Naveen Garg 个人学术档案 - 学术资源搜索

引用次数

	总计	2019 年至今
引用	6855	1639
h 指数	33	21
i10 指数	54	31

380

190

285

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202423 38 28 50 50 61 58 115 115 174 219 253 297 297 293 270 256 315 251 307 301 301 338 321 365 296 343 305 307 260 128

开放获取的出版物数量

查看全部

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 的电子邮件经过验证
Sibel SalmanProfessor, Industrial Engineering, Koc University在 ku.edu.tr 的电子邮件经过验证
Guy EvenEE, Tel-Aviv Univ在 eng.tau.ac.il 的电子邮件经过验证
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 GargAssistant 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	1166	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	1046	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	428	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	423	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	258	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	252	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	168	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	153	1993
Multiway cuts in node weighted graphs N Garg, VV Vazirani, M Yannakakis Journal of Algorithms 50 (1), 49-61, 2004	147	2004
Assigning papers to referees N Garg, T Kavitha, A Kumar, K Mehlhorn, J Mestre Algorithmica 58, 119-136, 2010	131	2010
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	131	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	127	2012
A 5-approximation for capacitated facility location M Bansal, N Garg, N Gupta Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012	98	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	93*	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	82	1994
Stochastic analyses for online combinatorial optimization problems N Garg, A Gupta, S Leonardi, P Sankowski Carnegie Mellon University, 2008	77	2008
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	77	2000

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

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用