( en | de | ru )

 

Disambiguation of "Garg, Naveen"

Author of the publication

copydeleteadd this publication to your clipboard
Parallel Machine Scheduling to Minimize Energy Consumption.

, , , and . CoRR, (2019)

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.

Naveen

Neil Garg

Naveen Kumar

Animesh Garg

Priya Garg

 

Other publications of authors with the same name

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