Naveen Garg

Citado por

	Todos	Desde 2017
Citações	6433	1943
Índice h	33	23
Índice i10	50	30

380

190

285

1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202216 43 27 48 58 59 60 89 111 164 226 253 286 298 290 272 262 326 262 302 297 294 331 322 361 294 353 300 311

Acesso público

Ver tudo

3 artigos

0 artigos

disponível

não disponível

Com base em autorizações de financiamento

Coautores

Vijay VaziraniDistinguished Professor, Dept. of Computer Science, University of California, Irvine.Email confirmado em ics.uci.edu
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityEmail confirmado em cs.columbia.edu
R RaviCarnegie Mellon UnviersityEmail confirmado em andrew.cmu.edu
Vinayaka PanditResearcher, IBM ResearchEmail confirmado em in.ibm.com
Jochen KoenemannUniversity of WaterlooEmail confirmado em uwaterloo.ca
Amitabh SinhaAmazonEmail confirmado em amazon.com
Manisha BansalDepartment of Computer Science, Indraprastha College for Women, University of Delhi.Email confirmado em ip.du.ac.in
Kamesh MunagalaProfessor of Computer Science, Duke UniversityEmail confirmado em cs.duke.edu
Adam MeyersonGoogle, Inc.Email confirmado em google.com
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusEmail confirmado em mpi-inf.mpg.de
Neelima GuptaDepartment of Computer Science, University of DelhiEmail confirmado em cs.du.ac.in
Muralidhara V NAssociate Professor of Computer Science, IIIT Bangalore.Email confirmado em iiitb.ac.in
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeEmail confirmado em dis.uniroma1.it
Guy EvenEE, Tel-Aviv UnivEmail confirmado em eng.tau.ac.il
Michel GoemansRSA Professor of Mathematics, MITEmail confirmado em math.mit.edu
Philippas TsigasProfessor of Computer Science, Chalmers University of TechnologyEmail confirmado em chalmers.se
Anand LouisIndian Institute of ScienceEmail confirmado em iisc.ac.in
Jugal GargAssistant Professor, University of Illinois at Urbana-ChampaignEmail confirmado em illinois.edu
Martin HoeferProfessor of Computer Science, Goethe University Frankfurt/MainEmail confirmado em cs.uni-frankfurt.de
Nikhil KumarHasso-Plattner-InstitutEmail confirmado em hpi.de

Seguir

Naveen Garg

Computer Science and Engineering, IIT Delhi

Email confirmado em cse.iitd.ac.in - Página inicial

Algorithms and Complexity Optimization


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
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	1084	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	1003	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	1002	2007
Primal-dual approximation algorithms for integral flow and multicut in trees N Garg, VV Vazirani, M Yannakakis Algorithmica 18 (1), 3-20, 1997	457	1997
Approximate max-flow min-(multi) cut theorems and their applications N Garg, VV Vazirani, M Yannakakis SIAM Journal on Computing 25, 235, 1996	406	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	403	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	247	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	244	2005
On the single-source unsplittable flow problem Y Dinitz, N Garg, MX Goemans Combinatorica 19 (1), 17-41, 1999	232	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	161	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	150	1993
Multiway cuts in node weighted graphs N Garg, VV Vazirani, M Yannakakis Journal of Algorithms 50 (1), 49-61, 2004	138	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	122	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	113	2004
Assigning papers to referees N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre Algorithmica 58 (1), 119-136, 2010	109	2010
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	86*	2013
A 5-approximation for capacitated facility location M Bansal, N Garg, N Gupta European Symposium on Algorithms, 133-144, 2012	85	2012
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	80	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	75	2000
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	72	2009

O sistema não pode efectuar a operação agora. Tente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações unidas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores