Inapproximability of Euclidean Steiner Tree

We consider the Euclidean Steiner Tree problem of connecting $n$ given points in $\mathbb{R}^d$ by a shortest network allowing the addition of Steiner points anywhere in the space. Arora [FOCS'96/'97, J. ACM'98] gave a polynomial-time approximation scheme (PTAS) for Euclidean Steiner Tree and TSP in every fixed dimension, and Trevisan [STOC'97, SICOMP'00] proved that Euclidean TSP is APX-hard in $O(\log n)$ dimensions. They left open whether Euclidean Steiner Tree admits a PTAS in high dimension. Our first contribution settles this thirty-year-old question by proving APX-hardness in $O(\log n)$ dimensions. Assuming that not all problems in NP can be solved in subexponential time (NP $\not\subseteq $SUBEXP), we also rule out a PTAS for Euclidean Steiner Tree in $O(\log\log n)$ dimensions. This dimension bound is tight up to a factor of $O(\log\log\log n)$, since Arora's scheme is a PTAS in up to $\log\log n/\log\log\log n$ dimensions. In fixed dimension, Kisfaludi-Bak, Nederlof, and Węgrzycki [FOCS'21, J. ACM'25] obtained approximation schemes running in time $2^{O_d(\varepsilon^{-(d-1)})}n\log n$ and proved matching Gap-ETH lower bounds for Euclidean TSP and Rectilinear Steiner Tree, but left a corresponding lower bound for Euclidean Steiner Tree as an open question. Our second contribution answers this question with a nearly tight lower bound on the dependence on accuracy for Euclidean Steiner Tree. However, given the recent claimed refutations of ETH and hence Gap-ETH by OpenAI and Anthropic, we use the weaker assumption that 3SAT has no truly subexponential-time algorithm, that is, no $2^{n^γ}$-time algorithm on formulas of size $n$ for any constant $γ<1$ (a hypothesis one might call weak ETH). Under this assumption, we prove that no $(1+\varepsilon)$-approximation algorithm runs in time $2^{O(\varepsilon^{-γ(d-1)})} poly(n)$ for any such $γ$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24611
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Inapproximability of Euclidean Steiner Tree

Simon Bartlmae
arXiv (Cornell University)
Complexity and Algorithms in Graphs
preprint

Inapproximability of Euclidean Steiner Tree

Simon Bartlmae
preprint en

Abstract

We consider the Euclidean Steiner Tree problem of connecting $n$ given points in $\mathbb{R}^d$ by a shortest network allowing the addition of Steiner points anywhere in the space. Arora [FOCS'96/'97, J. ACM'98] gave a polynomial-time approximation scheme (PTAS) for Euclidean Steiner Tree and TSP in every fixed dimension, and Trevisan [STOC'97, SICOMP'00] proved that Euclidean TSP is APX-hard in $O(\log n)$ dimensions. They left open whether Euclidean Steiner Tree admits a PTAS in high dimension. Our first contribution settles this thirty-year-old question by proving APX-hardness in $O(\log n)$ dimensions. Assuming that not all problems in NP can be solved in subexponential time (NP $\not\subseteq $SUBEXP), we also rule out a PTAS for Euclidean Steiner Tree in $O(\log\log n)$ dimensions. This dimension bound is tight up to a factor of $O(\log\log\log n)$, since Arora's scheme is a PTAS in up to $\log\log n/\log\log\log n$ dimensions. In fixed dimension, Kisfaludi-Bak, Nederlof, and Węgrzycki [FOCS'21, J. ACM'25] obtained approximation schemes running in time $2^{O_d(\varepsilon^{-(d-1)})}n\log n$ and proved matching Gap-ETH lower bounds for Euclidean TSP and Rectilinear Steiner Tree, but left a corresponding lower bound for Euclidean Steiner Tree as an open question. Our second contribution answers this question with a nearly tight lower bound on the dependence on accuracy for Euclidean Steiner Tree. However, given the recent claimed refutations of ETH and hence Gap-ETH by OpenAI and Anthropic, we use the weaker assumption that 3SAT has no truly subexponential-time algorithm, that is, no $2^{n^γ}$-time algorithm on formulas of size $n$ for any constant $γ<1$ (a hypothesis one might call weak ETH). Under this assumption, we prove that no $(1+\varepsilon)$-approximation algorithm runs in time $2^{O(\varepsilon^{-γ(d-1)})} poly(n)$ for any such $γ$.

arXiv (Cornell University)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon