( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A proof of the Boyd-Carr conjecture

, , и . Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, стр. 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.

David P Henry

Daniel Williamson

Elke Williamson

Adam Williamson

Adam Williamson

 

Другие публикации лиц с тем же именем

A 3/2-approximation algorithm for some minimum-cost graph problems., , и . Math. Program., 150 (1): 19-34 (2015)Assortment optimization over time., , и . Oper. Res. Lett., 43 (6): 608-611 (2015)Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems., и . SODA, стр. 1000-1001. ACM/SIAM, (2002)2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture., , и . Math. Oper. Res., 39 (2): 403-417 (2014).879-approximation algorithms for MAX CUT and MAX 2SAT., и . STOC, стр. 422-431. ACM, (1994)On the Integrality Gap of the Subtour LP for the 1, 2-TSP., , , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 606-617. Springer, (2012)The Online Connected Facility Location Problem., , и . LATIN, том 8392 из Lecture Notes in Computer Science, стр. 574-585. Springer, (2014)An O(logn)-Competitive Algorithm for Online Constrained Forest Problems., и . ICALP (1), том 6755 из Lecture Notes in Computer Science, стр. 37-48. Springer, (2011)Offline and Online Facility Leasing., и . IPCO, том 5035 из Lecture Notes in Computer Science, стр. 303-315. Springer, (2008)A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems., , и . CoRR, (2020)