Naveen Garg

Citeras av

	Alla	Sedan 2016
Citat	5580	1622
h-index	30	21
i10-index	46	26

360

180

270

19951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202129 23 39 51 55 51 79 93 141 231 237 282 288 277 268 254 315 244 295 293 286 325 301 350 286 345 15

Medförfattare

Rohit KhandekarKCG Holdings Inc.Verifierad e-postadress på kcg.com
Vijay VaziraniDistinguished Professor, Dept. of Computer Science, University of California, Irvine.Verifierad e-postadress på ics.uci.edu
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityVerifierad e-postadress på cs.columbia.edu
Vinayaka PanditResearcher, IBM ResearchVerifierad e-postadress på in.ibm.com
R RaviCarnegie Mellon UnviersityVerifierad e-postadress på andrew.cmu.edu
Jochen KoenemannUniversity of WaterlooVerifierad e-postadress på uwaterloo.ca
Amitabh SinhaAmazonVerifierad e-postadress på amazon.com
Kamesh MunagalaProfessor of Computer Science, Duke UniversityVerifierad e-postadress på cs.duke.edu
Adam MeyersonGoogle, Inc.Verifierad e-postadress på google.com
Neelima GuptaDepartment of Computer Science, University of DelhiVerifierad e-postadress på cs.du.ac.in
Manisha BansalDepartment of Computer Science, Indraprastha College for Women, University of Delhi.Verifierad e-postadress på ip.du.ac.in
Muralidhara V NAssociate Professor of Computer Science, IIIT Bangalore.Verifierad e-postadress på iiitb.ac.in
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeVerifierad e-postadress på dis.uniroma1.it
Guy EvenEE, Tel-Aviv UnivVerifierad e-postadress på eng.tau.ac.il
Michel GoemansLeighton Family Professor of Mathematics, MITVerifierad e-postadress på math.mit.edu
Philippas TsigasProfessor of Computer Science, Chalmers University of TechnologyVerifierad e-postadress på chalmers.se
Anand LouisIndian Institute of ScienceVerifierad e-postadress på iisc.ac.in
Sibel SalmanProfessor, Industrial Engineering, Koc UniversityVerifierad e-postadress på ku.edu.tr
Santosh S. VempalaGeorgia TechVerifierad e-postadress på gatech.edu
Marina PapatriantafilouAssoc. Professor of Computer Science and Engineering, Chalmers UniversityVerifierad e-postadress på chalmers.se

Naveen Garg

Computer Science and Engineering, IIT Delhi

Verifierad e-postadress på cse.iitd.ac.in - Startsida

Algorithms and Complexity Optimization


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
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	980	2004
Faster and simpler algorithms for multicommodity flow and other fractional packing problems N Garg, J Könemann SIAM Journal on Computing 37 (2), 630-652, 2007	922	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	921	2007
Primal-dual approximation algorithms for integral flow and multicut in trees N Garg, VV Vazirani, M Yannakakis Algorithmica 18 (1), 3-20, 1997	469*	1997
Approximate max-flow min-(multi) cut theorems and their applications N Garg, VV Vazirani, M Yannakakis SIAM Journal on Computing 25, 235, 1996	376	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	366	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	225	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	220	2005
On the single-source unsplittable flow problem Y Dinitz, N Garg, MX Goemans Combinatorica 19 (1), 17-41, 1999	213	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	152	1994
Multiway cuts in node weighted graphs N Garg, VV Vazirani, M Yannakakis Journal of Algorithms 50 (1), 49-61, 2004	127	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	108	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	93	2004
Assigning papers to referees N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre Algorithmica 58 (1), 119-136, 2010	81	2010
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	79	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	70	2000
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	68*	2013
A 5-approximation for capacitated facility location M Bansal, N Garg, N Gupta European Symposium on Algorithms, 133-144, 2012	65	2012
Stochastic analyses for online combinatorial optimization problems N Garg, A Gupta, S Leonardi, P Sankowski Carnegie Mellon University, 2008	64	2008
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	62	2009

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Ladda upp PDF

Följ den här författaren

Citeras av

Medförfattare