The steiner problem with edge lengths 1 and 2,
Information Processing Letters
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Approximation algorithms for single and multi-commodity connected facility location
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Primal-dual approximation algorithms for node-weighted steiner forest on planar graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Matroids and integrality gaps for hypergraphic steiner tree relaxations
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Minimum certificate dispersal with tree structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Information and Computation
Multi-rooted greedy approximation of directed steiner trees with applications
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
Guest column: the elusive inapproximability of the TSP
ACM SIGACT News
| Hi-index | 5.23 |
The Steiner tree problem on weighted graphs seeks a minimum weight subtree containing a given subset of the vertices (terminals). We show that it is NP-hard to approximate the Steiner tree problem within a factor 96/95. Our inapproximability results are stated in a parametric way, and explicit hardness factors would be improved automatically by providing gadgets and/or expanders with better parameters.