Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound

Operations Research Letters

Volumn 38, Issue 6, 2010, Pages 567-570

  Chakrabarty, Deeparnab ^a   Knemann, Jochen ^b   Pritchard, David ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c EPFL   (Switzerland)

Author keywords

Hypergraph; Integrality gap; Randomized algorithm; Steiner tree

Indexed keywords

HYPERGRAPH; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; RANDOMIZED ALGORITHM; STEINER TREE PROBLEM; STEINER TREES; UPPER BOUND;

ALGORITHMS;

TREES (MATHEMATICS);

EID: 77958111497     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2010.09.004     Document Type: Article

References (8)

1. J. Byrka, F. Grandoni, T. Rothvoß, L. Sanit, An improved LP-based approximation for Steiner tree, in: Proc. 42nd STOC, 2010, pp. 583592.
2. Deeparnab Chakrabarty, Jochen Knemann, David Pritchard, Hypergraphic LP relaxations for Steiner trees, in: Proc. 14th IPCO, 2010, pp. 383396. Full version at: arXiv:0910.0281.
3. J. Edmonds Matroids and the greedy algorithm Math. Program. 1 1971 127 136
4. C. Grpl, S. Hougardy, T. Nierhoff, and H.J. Prmel Approximation algorithms for the Steiner tree problem in graphs X. Cheng, D.Z. Du, Steiner Trees in Industries 2001 Kluwer Academic Publishers Norvell, Massachusetts 235 279
5. Tobias Polzin, and Siavash Vahdati Daneshmand On Steiner trees and minimum spanning trees in hypergraphs Oper. Res. Lett. 31 1 2003 12 20
6. G. Robins, and A. Zelikovsky Tighter bounds for graph Steiner tree approximation SIAM J. Discrete Math. 19 1 2005 122 134 Preliminary version appeared in Proc. 11th SODA, 2000, pp. 770779
7. A. Schrijver Combinatorial Optimization 2003 Springer New York
8. D.M. Warme A new exact algorithm for rectilinear Steiner trees P.M. Pardalos, D.-Z. Du, Network Design: Connectivity and Facilities Location 1997 American Mathematical Society 57 395 Result therein attributed to M. Queyranne