An improved LP-based approximation for steiner tree

@inproceedings{Byrka2010AnIL,
  title={An improved LP-based approximation for steiner tree},
  author={Jaroslaw Byrka and Fabrizio Grandoni and Thomas Rothvo\ss and Laura Sanit{\`a}},
  booktitle={STOC},
  year={2010}
}
The Steiner tree problem is one of the most fundamental NP-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for this problem was improved from 2 to the current best 1.55 [Robins,Zelikovsky-SIDMA'05]. All these algorithms are purely combinatorial. A long-standing open problem is whether there is an LP-relaxation for Steiner tree with integrality gap smaller than 2… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 194 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 126 extracted citations

Service Overlay Forest Embedding for Software-Defined Cloud Networks

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) • 2017
View 15 Excerpts
Highly Influenced

Algorithms for the minimum diameter terminal Steiner tree problem

J. Comb. Optim. • 2014
View 9 Excerpts
Highly Influenced

Designing Cost-Sharing Methods for Bayesian Games

Theory of Computing Systems • 2017
View 4 Excerpts
Highly Influenced

195 Citations

0102030'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 195 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Tighter Bounds for Graph Steiner Tree Approximation

SIAM J. Discrete Math. • 2005
View 13 Excerpts
Highly Influenced

Optimum branchings

J. Edmonds
J. Res. Nat. Bur. Standards, B71:233–240 • 1967
View 8 Excerpts
Highly Influenced

A Partition-Based Relaxation For Steiner Trees

View 6 Excerpts
Highly Influenced

Approximation Algorithms

Springer Berlin Heidelberg • 2001
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…