Author of the publication

A proof of the Boyd-Carr conjecture

, , and . Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, page 1477--1486. SIAM, (2012)

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

Offline and Online Facility Leasing., and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 303-315. Springer, (2008)An O(logn)-Competitive Algorithm for Online Constrained Forest Problems., and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 37-48. Springer, (2011)On the Integrality Gap of the Subtour LP for the 1, 2-TSP., , , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 606-617. Springer, (2012)The Online Connected Facility Location Problem., , and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 574-585. Springer, (2014)Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application., and . Inf. Process. Lett., 35 (6): 281-285 (1990)Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time., , , , , , , , , and . ICMLA, page 19-24. IEEE, (2020)An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem., and . ESA, volume 9294 of Lecture Notes in Computer Science, page 570-581. Springer, (2015)Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems., and . SODA, page 1000-1001. ACM/SIAM, (2002)Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler., and . SODA, page 366-375. ACM/SIAM, (1999).879-approximation algorithms for MAX CUT and MAX 2SAT., and . STOC, page 422-431. ACM, (1994)