| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438290 | Theoretical Computer Science | 2008 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
