Naveen Garg

Citée par

	Toutes	Depuis 2020
Citations	7024	1486
indice h	34	21
indice i10	54	31

380

190

285

1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202524 37 29 48 51 59 57 115 121 176 215 255 298 299 292 273 255 320 256 312 303 307 338 322 362 297 348 302 307 251 247 31

Accès public

Tout afficher

4 articles

0 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Vijay VaziraniDistinguished Professor, Dept. of Computer Science, University of California, Irvine.Adresse e-mail validée de ics.uci.edu
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityAdresse e-mail validée de cs.columbia.edu
R RaviCarnegie Mellon UnviersityAdresse e-mail validée de andrew.cmu.edu
Vinayaka PanditResearcher, IBM ResearchAdresse e-mail validée de in.ibm.com
Jochen KoenemannUniversity of WaterlooAdresse e-mail validée de uwaterloo.ca
Amitabh SinhaAmazonAdresse e-mail validée de amazon.com
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusAdresse e-mail validée de mpi-inf.mpg.de
Manisha BansalDepartment of Computer Science, Indraprastha College for Women, University of Delhi.Adresse e-mail validée de ip.du.ac.in
Kamesh MunagalaProfessor of Computer Science, Duke UniversityAdresse e-mail validée de cs.duke.edu
Adam MeyersonGoogle, Inc.Adresse e-mail validée de google.com
Neelima GuptaDepartment of Computer Science, University of DelhiAdresse e-mail validée de cs.du.ac.in
Muralidhara V NAssociate Professor of Computer Science, IIIT Bangalore.Adresse e-mail validée de iiitb.ac.in
Guy EvenEE, Tel-Aviv UnivAdresse e-mail validée de eng.tau.ac.il
Sibel SalmanProfessor, Industrial Engineering, Koc UniversityAdresse e-mail validée de ku.edu.tr
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeAdresse e-mail validée de dis.uniroma1.it
Nikhil KumarUniversity of WaterlooAdresse e-mail validée de uwaterloo.ca
Michel GoemansRSA Professor of Mathematics, MITAdresse e-mail validée de math.mit.edu
Anand LouisIndian Institute of ScienceAdresse e-mail validée de iisc.ac.in
Philippas TsigasProfessor of Computer Science, Chalmers University of TechnologyAdresse e-mail validée de chalmers.se
Jugal GargAssociate Professor, University of Illinois at Urbana-ChampaignAdresse e-mail validée de illinois.edu

Suivre

Naveen Garg

Computer Science and Engineering, IIT Delhi

Adresse e-mail validée de cse.iitd.ac.in - Page d'accueil

Algorithms and Complexity Optimization


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	1202	2004
Faster and simpler algorithms for multicommodity flow and other fractional packing problems N Garg, J Könemann SIAM Journal on Computing 37, 630, 2007	1060	2007
Primal-dual approximation algorithms for integral flow and multicut in trees N Garg, VV Vazirani, M Yannakakis Algorithmica 18 (1), 3-20, 1997	483	1997
A polylogarithmic approximation algorithm for the group Steiner tree problem N Garg, G Konjevod, R Ravi Journal of Algorithms 37 (1), 66-84, 2000	431	2000
Approximate max-flow min-(multi) cut theorems and their applications N Garg, VV Vazirani, M Yannakakis SIAM Journal on Computing 25, 235, 1996	430	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	273	2005
A 3-approximation for the minimum tree spanning k vertices N Garg Proceedings of 37th Conference on Foundations of Computer Science, 302-309, 1996	256	1996
On the single-source unsplittable flow problem Y Dinitz, N Garg, MX Goemans Combinatorica 19 (1), 17-41, 1999	241	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	172	1994
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	155	1993
Multiway cuts in node weighted graphs N Garg, VV Vazirani, M Yannakakis Journal of Algorithms 50 (1), 49-61, 2004	152	2004
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	139	2004
Assigning papers to referees N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre Algorithmica 58, 119-136, 2010	136	2010
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	133	2012
A 5-approximation for capacitated facility location M Bansal, N Garg, N Gupta Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012	102	2012
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	97*	2013
Stochastic analyses for online combinatorial optimization problems N Garg, A Gupta, S Leonardi, P Sankowski Carnegie Mellon University, 2008	82	2008
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	81	1994
The p-neighbor k-center problem S Chaudhuri, N Garg, R Ravi Information Processing Letters 65 (3), 131-134, 1998	80	1998
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	79	2009

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs