( en | de | ru )

 

Disambiguation of "Williamson, David P."

Author of the publication

copydeleteadd this publication to your clipboard
Improved Approximation Algorithms for Network Design Problems.

, , , , , and . SODA, page 223-232. ACM/SIAM, (1994)

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.

David P Henry

Daniel Williamson

Elke Williamson

Adam Williamson

Adam Williamson

 

Other publications of authors with the same name

A 3/2-approximation algorithm for some minimum-cost graph problems., , and . Math. Program., 150 (1): 19-34 (2015)Assortment optimization over time., , and . Oper. Res. Lett., 43 (6): 608-611 (2015)Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems., and . SODA, page 1000-1001. ACM/SIAM, (2002)2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture., , and . Math. Oper. Res., 39 (2): 403-417 (2014).879-approximation algorithms for MAX CUT and MAX 2SAT., and . STOC, page 422-431. ACM, (1994)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)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)Offline and Online Facility Leasing., and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 303-315. Springer, (2008)A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems., , and . CoRR, (2020)