Chandra Chekuri
TitleCited byYear
Maximizing a monotone submodular function subject to a matroid constraint
G Calinescu, C Chekuri, M Pál, J Vondrák
SIAM Journal on Computing 40 (6), 1740-1766, 2011
702*2011
Incremental clustering and dynamic information retrieval
M Charikar, C Chekuri, T Feder, R Motwani
SIAM Journal on Computing 33 (6), 1417-1440, 2004
6602004
Approximation algorithms for directed Steiner problems
M Charikar, C Chekuri, T Cheung, Z Dai, A Goel, S Guha, M Li
Journal of Algorithms 33 (1), 73-91, 1999
5561999
A polynomial time approximation scheme for the multiple knapsack problem
C Chekuri, S Khanna
SIAM Journal on Computing 35 (3), 713-728, 2005
5132005
On multidimensional packing problems
C Chekuri, S Khanna
SIAM journal on computing 33 (4), 837-851, 2004
366*2004
Conjunctive query containment revisited
C Chekuri, A Rajaraman
Theoretical Computer Science 239 (2), 211-229, 2000
3382000
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
2741999
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
252*1997
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
2271999
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
2172005
Web search using automatic classification
C Chekuri, MH Goldwasser, P Raghavan, E Upfal
Proceedings of the Sixth International Conference on the World Wide Web, 1997
2071997
Submodular function maximization via the multilinear relaxation and contention resolution schemes
C Chekuri, J Vondrák, R Zenklusen
SIAM Journal on Computing 43 (6), 1831-1879, 2014
2062014
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
2001998
Maximum coverage problem with group budget constraints and applications
C Chekuri, A Kumar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004
1932004
Dependent randomized rounding via exchange properties of combinatorial structures
C Chekuri, J Vondrak, R Zenklusen
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 575-584, 2010
191*2010
Experimental study of minimum cut algorithms
MS Levine
Massachusetts Institute of Technology, 1997
1661997
Improved algorithms for orienteering and related problems
C Chekuri, N Korula, M Pál
ACM Transactions on Algorithms (TALG) 8 (3), 23, 2012
1652012
Multicommodity demand flow in a tree and packing integer programs
C Chekuri, M Mydlarz, FB Shepherd
ACM Transactions on Algorithms (TALG) 3 (3), 27, 2007
163*2007
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median.
M Charikar, C Chekuri, A Goel, S Guha
STOC 98, 114-123, 1998
1571998
Approximation algorithms for the unsplittable flow problem
A Chakrabarti, C Chekuri, A Gupta, A Kumar
Algorithmica 47 (1), 53-78, 2007
146*2007
The system can't perform the operation now. Try again later.
Articles 1–20