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

Authors:
Deeparnab Chakrabarty;Jochen KöNemann;David Pritchard
Affiliations:
University of Pennsylvania, United States;University of Waterloo, Canada;ícole Polytechnique Fédérale de Lausanne, Switzerland
Venue:
Operations Research Letters
Year:
2010

Citing 4
Cited 2

Tighter Bounds for Graph Steiner Tree Approximation

SIAM Journal on Discrete Mathematics
An improved LP-based approximation for steiner tree

Proceedings of the forty-second ACM symposium on Theory of computing
Hypergraphic LP relaxations for steiner trees

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On Steiner trees and minimum spanning trees in hypergraphs

Operations Research Letters

Matroids and integrality gaps for hypergraphic steiner tree relaxations

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Steiner Tree Approximation via Iterative Randomized Rounding

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Byrka, Grandoni, Rothvosz and Sanita gave a 1.39 approximation for the Steiner tree problem, using a hypergraph-based linear programming relaxation. They also upper-bounded its integrality gap by 1.55. We describe a shorter proof of the same integrality gap bound, by applying some of their techniques to a randomized loss-contracting algorithm.