On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree

Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità. On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. Volume 28 of LIPIcs, pages 176-191, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.