| Maximizing a monotone submodular function subject to a matroid constraint G Calinescu, C Chekuri, M Pal, J Vondrák SIAM Journal on Computing 40 (6), 1740-1766, 2011 | 1281* | 2011 |
| Incremental clustering and dynamic information retrieval M Charikar, C Chekuri, T Feder, R Motwani Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 835 | 1997 |
| A polynomial time approximation scheme for the multiple knapsack problem C Chekuri, S Khanna SIAM Journal on Computing 35 (3), 713-728, 2005 | 724 | 2005 |
| Approximation algorithms for directed Steiner problems M Charikar, C Chekuri, TY Cheung, Z Dai, A Goel, S Guha, M Li Journal of Algorithms 33 (1), 73-91, 1999 | 665 | 1999 |
| On multidimensional packing problems C Chekuri, S Khanna SIAM journal on computing 33 (4), 837-851, 2004 | 483 | 2004 |
| Conjunctive query containment revisited C Chekuri, A Rajaraman Theoretical Computer Science 239 (2), 211-229, 2000 | 420 | 2000 |
| Submodular function maximization via the multilinear relaxation and contention resolution schemes C Chekuri, J Vondrák, R Zenklusen Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 402 | 2011 |
| Fast estimation of diameter and shortest paths (without matrix multiplication) D Aingworth, C Chekuri, P Indyk, R Motwani SIAM Journal on Computing 28 (4), 1167-1181, 1999 | 366 | 1999 |
| Dependent randomized rounding via exchange properties of combinatorial structures C Chekuri, J Vondrák, R Zenklusen 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 575-584, 2010 | 332* | 2010 |
| A recursive greedy algorithm for walks in directed graphs C Chekuri, M Pal 46th annual IEEE symposium on foundations of computer science (FOCS'05), 245-253, 2005 | 323 | 2005 |
| Approximation techniques for average completion time scheduling C Chekuri, R Motwani, B Natarajan, C Stein Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms …, 1997 | 285* | 1997 |
| Maximum coverage problem with group budget constraints and applications C Chekuri, A Kumar International Workshop on Randomization and Approximation Techniques in …, 2004 | 272 | 2004 |
| Approximation schemes for minimizing average weighted completion time with release dates F Afrati, E Bampis, C Chekuri, D Karger, C Kenyon, S Khanna, I Milis, ... 40th annual symposium on foundations of computer science (Cat. No. 99CB37039 …, 1999 | 257 | 1999 |
| Improved algorithms for orienteering and related problems C Chekuri, N Korula, M Pál ACM Transactions on Algorithms (TALG) 8 (3), 1-27, 2012 | 244 | 2012 |
| Approximating a finite metric by a small number of tree metrics M Charikar, C Chekuri, A Goel, S Guha, S Plotkin Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998 | 237 | 1998 |
| Web search using automatic classification C Chekuri, MH Goldwasser, P Raghavan, E Upfal Proceedings of the Sixth International Conference on the World Wide Web, 1-10, 1997 | 236 | 1997 |
| Polynomial bounds for the grid-minor theorem C Chekuri, J Chuzhoy Journal of the ACM (JACM) 63 (5), 1-65, 2016 | 208 | 2016 |
| Multicommodity demand flow in a tree and packing integer programs C Chekuri, M Mydlarz, FB Shepherd ACM Transactions on Algorithms (TALG) 3 (3), 27-es, 2007 | 196* | 2007 |
| Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median M Charikar, C Chekuri, A Goel, S Guha Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 196 | 1998 |
| Experimental Study of Minimum Cut Algorithms. C Chekuri, AV Goldberg, DR Karger, MS Levine, C Stein SODA 97, 324-333, 1997 | 190 | 1997 |
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of Pennsylvania在 cis.upenn.edu 的电子邮件经过验证
