23 citations · 38 across the 14 of their papers we have counts for
1 paper · 1 filter
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…