Naveen Garg

Citata da

	Tutte	Dal 2020
Citazioni	7073	1530
Indice H	34	21
i10-index	54	31

380

190

285

1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202525 39 31 46 52 60 55 111 118 177 217 260 299 298 290 280 258 321 251 309 296 306 346 322 364 299 352 311 314 253 252 48

Accesso pubblico

Visualizza tutto

4 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Vijay VaziraniDistinguished Professor, Dept. of Computer Science, University of California, Irvine.Email verificata su ics.uci.edu
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityEmail verificata su cs.columbia.edu
R RaviCarnegie Mellon UnviersityEmail verificata su andrew.cmu.edu
Vinayaka PanditResearcher, IBM ResearchEmail verificata su in.ibm.com
Jochen KoenemannUniversity of WaterlooEmail verificata su uwaterloo.ca
Amitabh SinhaAmazonEmail verificata su amazon.com
Adam MeyersonGoogle, Inc.Email verificata su google.com
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusEmail verificata su mpi-inf.mpg.de
Manisha BansalDepartment of Computer Science, Indraprastha College for Women, University of Delhi.Email verificata su ip.du.ac.in
Kamesh MunagalaProfessor of Computer Science, Duke UniversityEmail verificata su cs.duke.edu
Neelima GuptaDepartment of Computer Science, University of DelhiEmail verificata su cs.du.ac.in
Muralidhara V NAssociate Professor of Computer Science, IIIT Bangalore.Email verificata su iiitb.ac.in
Guy EvenEE, Tel-Aviv UnivEmail verificata su eng.tau.ac.il
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeEmail verificata su dis.uniroma1.it
Sibel SalmanProfessor, Industrial Engineering, Koc UniversityEmail verificata su ku.edu.tr
Nikhil KumarUniversity of WaterlooEmail verificata su uwaterloo.ca
Michel GoemansRSA Professor of Mathematics, MITEmail verificata su math.mit.edu
Anand LouisIndian Institute of ScienceEmail verificata su iisc.ac.in
Jugal GargAssociate Professor, University of Illinois at Urbana-ChampaignEmail verificata su illinois.edu
Martin HoeferProfessor of Computer Science, RWTH Aachen UniversityEmail verificata su cs.rwth-aachen.de

Segui

Naveen Garg

Computer Science and Engineering, IIT Delhi

Email verificata su cse.iitd.ac.in - Home page

Algorithms and Complexity Optimization


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	1224	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	494	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	432	2000
Approximate max-flow min-(multi) cut theorems and their applications N Garg, VV Vazirani, M Yannakakis SIAM Journal on Computing 25, 235, 1996	432	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	274	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	244	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	170	1994
Multiway cuts in node weighted graphs N Garg, VV Vazirani, M Yannakakis Journal of Algorithms 50 (1), 49-61, 2004	154	2004
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	154	1993
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	140	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	135	2012
Assigning papers to referees N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre Algorithmica 58, 119-136, 2010	132	2010
A 5-approximation for capacitated facility location M Bansal, N Garg, N Gupta Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012	104	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	99*	2013
The p-neighbor k-center problem S Chaudhuri, N Garg, R Ravi Information Processing Letters 65 (3), 131-134, 1998	82	1998
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
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	80	2009
Stochastic analyses for online combinatorial optimization problems N Garg, A Gupta, S Leonardi, P Sankowski Carnegie Mellon University, 2008	80	2008

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori