activity
20082026
most citedOn Column-restricted and Priority Covering Integer Programs

43 citations · 181 across the 50 of their papers we have counts for

collaborators
Showing 2010 · cs.DMShow all

1 paper · 2 filters

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…