Naveen Garg

引用次数

	总计	2020 年至今
引用	7024	1487
h 指数	34	21
i10 指数	54	31

380

190

285

1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202524 37 29 48 51 59 57 115 120 176 215 255 298 299 292 273 255 320 258 312 301 307 338 322 362 297 348 302 308 250 248 31

开放获取的出版物数量

查看全部

4 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Vijay VaziraniDistinguished Professor, Dept. of Computer Science, University of California, Irvine.在 ics.uci.edu 的电子邮件经过验证
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia University在 cs.columbia.edu 的电子邮件经过验证
R RaviCarnegie Mellon Unviersity在 andrew.cmu.edu 的电子邮件经过验证
Vinayaka PanditResearcher, IBM Research在 in.ibm.com 的电子邮件经过验证
Jochen KoenemannUniversity of Waterloo在 uwaterloo.ca 的电子邮件经过验证
Amitabh SinhaAmazon在 amazon.com 的电子邮件经过验证
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics Campus在 mpi-inf.mpg.de 的电子邮件经过验证
Manisha BansalDepartment of Computer Science, Indraprastha College for Women, University of Delhi.在 ip.du.ac.in 的电子邮件经过验证
Kamesh MunagalaProfessor of Computer Science, Duke University在 cs.duke.edu 的电子邮件经过验证
Adam MeyersonGoogle, Inc.在 google.com 的电子邮件经过验证
Neelima GuptaDepartment of Computer Science, University of Delhi在 cs.du.ac.in 的电子邮件经过验证
Muralidhara V NAssociate Professor of Computer Science, IIIT Bangalore.在 iiitb.ac.in 的电子邮件经过验证
Guy EvenEE, Tel-Aviv Univ在 eng.tau.ac.il 的电子邮件经过验证
Sibel SalmanProfessor, Industrial Engineering, Koc University在 ku.edu.tr 的电子邮件经过验证
Stefano LeonardiProfessor of Computer Science, Sapienza University of Rome在 dis.uniroma1.it 的电子邮件经过验证
Nikhil KumarUniversity of Waterloo在 uwaterloo.ca 的电子邮件经过验证
Michel GoemansRSA Professor of Mathematics, MIT在 math.mit.edu 的电子邮件经过验证
Anand LouisIndian Institute of Science在 iisc.ac.in 的电子邮件经过验证
Philippas TsigasProfessor of Computer Science, Chalmers University of Technology在 chalmers.se 的电子邮件经过验证
Jugal GargAssociate Professor, University of Illinois at Urbana-Champaign在 illinois.edu 的电子邮件经过验证

关注

Naveen Garg

Computer Science and Engineering, IIT Delhi

在 cse.iitd.ac.in 的电子邮件经过验证 - 首页

Algorithms and Complexity Optimization


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

关注

引用次数

合著作者