most citedIntegrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DM2010★ 1 cited

Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound

Deeparnab Chakrabarty, Jochen Koenemann, David Pritchard

Recently Byrka, Grandoni, Rothvoss and Sanita (at STOC 2010) gave a 1.39-approximation for the Steiner tree problem, using a hypergraph-based linear programming relaxation. They al…