Hypergraphic LP Relaxations for Steiner Trees - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Deeparnab Chakrabarty, Jochen Könemann, David Pritchard. Hypergraphic LP Relaxations for Steiner Trees. In Friedrich Eisenbrand, F. Bruce Shepherd, editors, Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings. Volume 6080 of Lecture Notes in Computer Science, pages 383-396, Springer, 2010. [doi]

The following publications are possibly variants of this publication:

Hypergraphic LP Relaxations for Steiner TreesDeeparnab Chakrabarty, Jochen Könemann, David Pritchard. siamdm, 27(1):507-533, 2013. [doi]

On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner TreeAndreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità. approx 2014: 176-191 [doi]

On the equivalence of the bidirected and hypergraphic relaxations for Steiner treeAndreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità. mp, 160(1-2):379-406, 2016. [doi]

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper boundDeeparnab Chakrabarty, Jochen Könemann, David Pritchard. orl, 38(6):567-570, 2010. [doi]

A partition-based relaxation for Steiner treesJochen Könemann, David Pritchard, Kunlun Tan. mp, 127(2):345-370, 2011. [doi]

runs on WebDSL