Seuraa
Naveen Garg
Naveen Garg
Computer Science and Engineering, IIT Delhi
Vahvistettu sähköpostiosoite verkkotunnuksessa cse.iitd.ac.in - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Local search heuristics for k-median and facility location problems
V Arya, N Garg, R Khandekar, A Meyerson, K Munagala, V Pandit
SIAM Journal on Computing 33 (3), 544-562, 2004
11892004
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
N Garg, J Könemann
SIAM Journal on Computing 37, 630, 2007
10532007
Primal-dual approximation algorithms for integral flow and multicut in trees
N Garg, VV Vazirani, M Yannakakis
Algorithmica 18 (1), 3-20, 1997
4811997
Approximate max-flow min-(multi) cut theorems and their applications
N Garg, VV Vazirani, M Yannakakis
SIAM Journal on Computing 25, 235, 1996
4301996
A polylogarithmic approximation algorithm for the group Steiner tree problem
N Garg, G Konjevod, R Ravi
Journal of Algorithms 37 (1), 66-84, 2000
4272000
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
N Garg
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
2672005
A 3-approximation for the minimum tree spanning k vertices
N Garg
Proceedings of 37th Conference on Foundations of Computer Science, 302-309, 1996
2551996
On the single-source unsplittable flow problem
Y Dinitz, N Garg, MX Goemans
Combinatorica 19 (1), 17-41, 1999
2391999
Multiway cuts in directed and node weighted graphs
N Garg, VV Vazirani, M Yannakakis
International Colloquium on Automata, Languages, and Programming, 487-498, 1994
1711994
Approximate max-flow min-(multi) cut theorems and their applications
N Garg, VV Vazirani, M Yannakakis
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993
1551993
Multiway cuts in node weighted graphs
N Garg, VV Vazirani, M Yannakakis
Journal of Algorithms 50 (1), 49-61, 2004
1502004
Assigning papers to referees
N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre
Algorithmica 58, 119-136, 2010
1332010
Resource augmentation for weighted flow-time explained by dual fitting
S Anand, N Garg, A Kumar
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1312012
Min–max tree covers of graphs
G Even, N Garg, J Könemann, R Ravi, A Sinha
Operations Research Letters 32 (4), 309-315, 2004
1302004
A 5-approximation for capacitated facility location
M Bansal, N Garg, N Gupta
Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012
1002012
A 3-approximation algorithm for the facility location problem with uniform capacities
A Aggarwal, A Louis, M Bansal, N Garg, N Gupta, S Gupta, S Jain
Mathematical Programming 141 (1), 527-547, 2013
96*2013
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
N Garg, DS Hochbaum
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
811994
The p-neighbor k-center problem
S Chaudhuri, N Garg, R Ravi
Information Processing Letters 65 (3), 131-134, 1998
791998
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
JS Chadha, N Garg, A Kumar, VN Muralidhara
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
772009
Stochastic analyses for online combinatorial optimization problems
N Garg, A Gupta, S Leonardi, P Sankowski
Carnegie Mellon University, 2008
772008
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20