( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation algorithm for k-node connected subgraphs via critical graphs.

, и . STOC, стр. 138-145. ACM, (2004)

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.

Olga Guyot

Thomas Guyet

Peter Guyot

Irene Guy

Bodo Guyet

 

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

Sum Multicoloring of Graphs., , , , и . J. Algorithms, 37 (2): 422-450 (2000)On the Advantage of Overlapping Clusters for Minimizing Conductance., , и . Algorithmica, 69 (4): 844-863 (2014)Approximating Shallow-Light Trees (Extended Abstract)., и . SODA, стр. 103-110. ACM/SIAM, (1997)Prize-collecting steiner network problems., , , и . ACM Trans. Algorithms, 9 (1): 2:1-2:13 (2012)Approximation algorithm for k-node connected subgraphs via critical graphs., и . STOC, стр. 138-145. ACM, (2004)On Set Expansion Problems and the Small Set Expansion Conjecture., и . WG, том 8747 из Lecture Notes in Computer Science, стр. 189-200. Springer, (2014)Tight Approximation Algorithm for Connectivity Augmentation Problems., и . ICALP (1), том 4051 из Lecture Notes in Computer Science, стр. 443-452. Springer, (2006)Min Sum Edge Coloring in Multigraphs Via Configuration LP., , и . IPCO, том 5035 из Lecture Notes in Computer Science, стр. 359-373. Springer, (2008)Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria., , , и . WAOA, том 3351 из Lecture Notes in Computer Science, стр. 68-82. Springer, (2004)Approximation Algorithms for Minimum Time Broadcast., и . ISTCS, том 601 из Lecture Notes in Computer Science, стр. 67-78. Springer, (1992)