Author of the publication

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree.

, , , and . Math. Program., 160 (1-2): 379-406 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Primal-dual based distributed algorithms for vertex cover with semi-hard capacities., , , and . PODC, page 118-125. ACM, (2005)A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees., and . STOC, page 537-546. ACM, (2000)Approximate Deadline-Scheduling with Precedence Constraints., , , , , and . ESA, volume 9294 of Lecture Notes in Computer Science, page 483-495. Springer, (2015)Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees., and . FSTTCS, volume 2914 of Lecture Notes in Computer Science, page 289-301. Springer, (2003)Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances., , and . Theory Comput. Syst., 57 (3): 655-672 (2015)Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances, , , and . CoRR, (2012)A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs ., , and . SWAT, volume 53 of LIPIcs, page 3:1-3:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A General Framework for Computing the Nucleolus via Dynamic Programming., and . SAGT, volume 12283 of Lecture Notes in Computer Science, page 307-321. Springer, (2020)On generalizations of network design problems with degree bounds., , , , and . Math. Program., 141 (1-2): 479-506 (2013)Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds., and . SIAM J. Comput., 34 (3): 763-773 (2005)