( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Assigning Papers to Referees.

, , , , и . Algorithmica, 58 (1): 119-136 (2010)

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.

Naveen

Neil Garg

Naveen Kumar

Animesh Garg

Priya Garg

 

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

A polyhedron with all s-t cuts as vertices, and adjacency of cuts., и . IPCO, стр. 281-289. CIACO, (1993)The Flow Game: Leximin and Leximax Core Imputations., , , и . CoRR, (2024)An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane., и . Algorithmica, 18 (1): 111-121 (1997)Fair Division of Indivisible Goods for a Class of Concave Valuations., , , , , и . J. Artif. Intell. Res., (2022)On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem., , , , , и . IPCO, том 2081 из Lecture Notes in Computer Science, стр. 170-184. Springer, (2001)Price of Anarchy, Locality Gap, and a Network Service Provider Game., , , , , и . WINE, том 3828 из Lecture Notes in Computer Science, стр. 1046-1055. Springer, (2005)Approximate max-flow min-(multi)cut theorems and their applications., , и . STOC, стр. 698-707. ACM, (1993)Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems., и . FOCS, стр. 500-. IEEE Computer Society, (2002)Better Algorithms for Minimizing Average Flow-Time on Related Machines., и . ICALP (1), том 4051 из Lecture Notes in Computer Science, стр. 181-190. Springer, (2006)Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems., и . FOCS, стр. 300-309. IEEE Computer Society, (1998)