Naveen Garg - Google Scholar Citations

Cited by

	All	Since 2015
Citations	5225	1613
h-index	29	20
i10-index	47	29

360

180

270

1995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202029 24 42 57 48 52 79 94 146 222 235 281 272 271 272 252 307 235 299 294 273 322 308 356 295 56

Co-authors

Vijay VaziraniDistinguished Professor, Dept. of Computer Science, University of California, Irvine.Verified email at ics.uci.edu
Rohit KhandekarKCG Holdings Inc.Verified email at kcg.com
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityVerified email at cs.columbia.edu
Vinayaka PanditResearcher, IBM ResearchVerified email at in.ibm.com
R RaviCarnegie Mellon UnviersityVerified email at andrew.cmu.edu
Jochen KoenemannUniversity of WaterlooVerified email at uwaterloo.ca
Amitabh SinhaAmazonVerified email at amazon.com
Kamesh MunagalaProfessor of Computer Science, Duke UniversityVerified email at cs.duke.edu
Adam MeyersonGoogle, Inc.Verified email at google.com
Neelima GuptaDepartment of Computer Science, University of DelhiVerified email at cs.du.ac.in
Manisha BansalDepartment of Computer Science, Indraprastha College for Women, University of Delhi.Verified email at ip.du.ac.in
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeVerified email at dis.uniroma1.it
Muralidhara V NAssociate Professor of Computer Science, IIIT Bangalore.Verified email at iiitb.ac.in
Guy EvenEE, Tel-Aviv UnivVerified email at eng.tau.ac.il
Michel GoemansLeighton Family Professor of Mathematics, MITVerified email at math.mit.edu
Philippas TsigasProfessor of Computer Science, Chalmers University of TechnologyVerified email at chalmers.se
Anand LouisIndian Institute of ScienceVerified email at iisc.ac.in
Piotr SankowskiComputer Science, Warsaw UniversityVerified email at mimuw.edu.pl
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Julián MestreSchool of Computer Science, The University of SydneyVerified email at sydney.edu.au

Naveen Garg

Computer Science and Engineering, IIT Delhi

Verified email at cse.iitd.ac.in

Algorithms and Complexity Optimization


Title	Cited by	Year
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	897	2004
Faster and simpler algorithms for multicommodity flow and other fractional packing problems N Garg, J Koenemann SIAM Journal on Computing 37 (2), 630-652, 2007	871	2007
Faster and simpler algorithms for multicommodity flow and other fractional packing problems N Garg, J Könemann SIAM Journal on Computing 37, 630, 2007	871	2007
Primal-dual approximation algorithms for integral flow and multicut in trees N Garg, VV Vazirani, M Yannakakis Algorithmica 18 (1), 3-20, 1997	453*	1997
Approximate max-flow min-(multi) cut theorems and their applications N Garg, VV Vazirani, M Yannakakis SIAM Journal on Computing 25, 235, 1996	364	1996
A polylogarithmic approximation algorithm for the group Steiner tree problem N Garg, G Konjevod, R Ravi Journal of Algorithms 37 (1), 66-84, 2000	338	2000
A 3-approximation for the minimum tree spanning k vertices N Garg Proceedings of 37th Conference on Foundations of Computer Science, 302-309, 1996	216	1996
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	212	2005
On the single-source unsplittable flow problem Y Dinitz, N Garg, MX Goemans Combinatorica 19 (1), 17-41, 1999	199	1999
Multiway cuts in directed and node weighted graphs N Garg, VV Vazirani, M Yannakakis International Colloquium on Automata, Languages, and Programming, 487-498, 1994	147	1994
Multiway cuts in node weighted graphs N Garg, VV Vazirani, M Yannakakis Journal of Algorithms 50 (1), 49-61, 2004	120	2004
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	94	2012
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	85	2004
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	78	1994
Minimizing stall time in single and parallel disk systems S Albers, N Garg, S Leonardi Journal of the ACM (JACM) 47 (6), 969-986, 2000	71	2000
Stochastic analyses for online combinatorial optimization problems N Garg, A Gupta, S Leonardi, P Sankowski Carnegie Mellon University, 2008	62	2008
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-2), 527-547, 2013	60*	2013
A 5-approximation for capacitated facility location M Bansal, N Garg, N Gupta European Symposium on Algorithms, 133-144, 2012	59	2012
Assigning papers to referees N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre Algorithmica 58 (1), 119-136, 2010	59	2010
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	56	2009

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors