File(s) not publicly available
The Steiner tree problem on graphs: Inapproximability results
journal contribution
posted on 2023-06-08, 06:22 authored by Miroslav ChlebikMiroslav Chlebik, Janka Chlebíková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.
History
Publication status
- Published
Journal
Theoretical Computer ScienceISSN
0304-3975External DOI
Issue
3Volume
406Page range
207-214Pages
8.0Department affiliated with
- Mathematics Publications
Full text available
- No
Peer reviewed?
- Yes