( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An O(logn)-Competitive Algorithm for Online Constrained Forest Problems.

, и . ICALP (1), том 6755 из Lecture Notes in Computer Science, стр. 37-48. Springer, (2011)

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

 

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

Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler., и . SODA, стр. 366-375. ACM/SIAM, (1999).879-approximation algorithms for MAX CUT and MAX 2SAT., и . STOC, стр. 422-431. ACM, (1994)Learning to Solve Combinatorial Optimization Problems on Real-World Graphs in Linear Time., , , , , , , , , и . ICMLA, стр. 19-24. IEEE, (2020)A proof of the Boyd-Carr conjecture., , и . SODA, стр. 1477-1486. SIAM, (2012)Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation., , и . IPCO, том 2081 из Lecture Notes in Computer Science, стр. 60-70. Springer, (2001)An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem., и . ESA, том 9294 из Lecture Notes in Computer Science, стр. 570-581. Springer, (2015)Offline and Online Facility Leasing., и . IPCO, том 5035 из Lecture Notes in Computer Science, стр. 303-315. Springer, (2008)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)