The 2-connected bottleneck Steiner network problem is NP-hard in any ℓ_p plane, with inapproximability ratio 2^{1/p}−ε for 1≤p<∞.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The $2$-connected bottleneck Steiner network problem is NP-hard in any $\ell_p$ plane
The 2-connected bottleneck Steiner network problem is NP-hard in any ℓ_p plane, with inapproximability ratio 2^{1/p}−ε for 1≤p<∞.