Naveen Garg

Citat de

	Toate	Din 2019
Referințe bibliografice	6939	1703
h-index	33	21
i10-index	54	32

380

190

285

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202424 37 29 48 51 60 57 115 120 176 215 255 298 298 295 270 256 319 256 311 303 304 338 321 365 297 348 301 309 255 193

Acces public

Afișați-le pe toate

4 articole

0 articole

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Vijay VaziraniDistinguished Professor, Dept. of Computer Science, University of California, Irvine.Adresă de e-mail confirmată pe ics.uci.edu
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityAdresă de e-mail confirmată pe cs.columbia.edu
R RaviCarnegie Mellon UnviersityAdresă de e-mail confirmată pe andrew.cmu.edu
Vinayaka PanditResearcher, IBM ResearchAdresă de e-mail confirmată pe in.ibm.com
Jochen KoenemannUniversity of WaterlooAdresă de e-mail confirmată pe uwaterloo.ca
Amitabh SinhaAmazonAdresă de e-mail confirmată pe amazon.com
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusAdresă de e-mail confirmată pe mpi-inf.mpg.de
Manisha BansalDepartment of Computer Science, Indraprastha College for Women, University of Delhi.Adresă de e-mail confirmată pe ip.du.ac.in
Kamesh MunagalaProfessor of Computer Science, Duke UniversityAdresă de e-mail confirmată pe cs.duke.edu
Adam MeyersonGoogle, Inc.Adresă de e-mail confirmată pe google.com
Neelima GuptaDepartment of Computer Science, University of DelhiAdresă de e-mail confirmată pe cs.du.ac.in
Muralidhara V NAssociate Professor of Computer Science, IIIT Bangalore.Adresă de e-mail confirmată pe iiitb.ac.in
Sibel SalmanProfessor, Industrial Engineering, Koc UniversityAdresă de e-mail confirmată pe ku.edu.tr
Guy EvenEE, Tel-Aviv UnivAdresă de e-mail confirmată pe eng.tau.ac.il
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeAdresă de e-mail confirmată pe dis.uniroma1.it
Nikhil KumarUniversity of WaterlooAdresă de e-mail confirmată pe uwaterloo.ca
Michel GoemansRSA Professor of Mathematics, MITAdresă de e-mail confirmată pe math.mit.edu
Anand LouisIndian Institute of ScienceAdresă de e-mail confirmată pe iisc.ac.in
Philippas TsigasProfessor of Computer Science, Chalmers University of TechnologyAdresă de e-mail confirmată pe chalmers.se
Jugal GargAssistant Professor, University of Illinois at Urbana-ChampaignAdresă de e-mail confirmată pe illinois.edu

Urmăriți

Naveen Garg

Computer Science and Engineering, IIT Delhi

Adresă de e-mail confirmată pe cse.iitd.ac.in - Pagina de pornire

Algorithms and Complexity Optimization


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
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	1189	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	1053	2007
Primal-dual approximation algorithms for integral flow and multicut in trees N Garg, VV Vazirani, M Yannakakis Algorithmica 18 (1), 3-20, 1997	481	1997
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
A polylogarithmic approximation algorithm for the group Steiner tree problem N Garg, G Konjevod, R Ravi Journal of Algorithms 37 (1), 66-84, 2000	427	2000
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	267	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	255	1996
On the single-source unsplittable flow problem Y Dinitz, N Garg, MX Goemans Combinatorica 19 (1), 17-41, 1999	239	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	171	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	150	2004
Assigning papers to referees N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre Algorithmica 58, 119-136, 2010	133	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	131	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	130	2004
A 5-approximation for capacitated facility location M Bansal, N Garg, N Gupta Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012	100	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	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	81	1994
The p-neighbor k-center problem S Chaudhuri, N Garg, R Ravi Information Processing Letters 65 (3), 131-134, 1998	79	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	77	2009
Stochastic analyses for online combinatorial optimization problems N Garg, A Gupta, S Leonardi, P Sankowski Carnegie Mellon University, 2008	77	2008

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori