Abstract
Steiner tree problem in 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 96/95. Our inapproximability results are stated in parametric way and can be further improved just providing gadgets and/or expanders with better parameters. The reduction is from Håstad’s inapproximability result for maximum satisfiability of linear equations modulo 2 with three unknowns per equation. This was first used for the Steiner tree problem by Thimm whose approach was the main starting point for our results.
Cite
CITATION STYLE
Chlebík, M., & Chlebíková, J. (2002). Approximation hardness of the steiner tree problem on graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2368, pp. 170–179). Springer Verlag. https://doi.org/10.1007/3-540-45471-3_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
