Seuraa
Chandra Chekuri
Chandra Chekuri
Professor of Computer Science, University of Illinois, Urbana-Champaign
Vahvistettu sähköpostiosoite verkkotunnuksessa illinois.edu - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
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
1021*2011
Incremental clustering and dynamic information retrieval
M Charikar, C Chekuri, T Feder, R Motwani
SIAM Journal on Computing 33 (6), 1417-1440, 2004
7642004
A polynomial time approximation scheme for the multiple knapsack problem
C Chekuri, S Khanna
SIAM Journal on Computing 35 (3), 713-728, 2005
6352005
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
6311999
On multidimensional packing problems
C Chekuri, S Khanna
SIAM journal on computing 33 (4), 837-851, 2004
432*2004
Conjunctive query containment revisited
C Chekuri, A Rajaraman
Theoretical Computer Science 239 (2), 211-229, 2000
3912000
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
3221999
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
3142014
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
279*1997
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
2682005
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
266*2010
Maximum coverage problem with group budget constraints and applications
C Chekuri, A Kumar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2004
2452004
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
2371999
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
2251997
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
2241998
Improved algorithms for orienteering and related problems
C Chekuri, N Korula, M Pál
ACM Transactions on Algorithms (TALG) 8 (3), 1-27, 2012
2102012
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
189*2007
Experimental Study of Minimum Cut Algorithms.
C Chekuri, AV Goldberg, DR Karger, MS Levine, C Stein
SODA 97, 324-333, 1997
1841997
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
1801998
Polynomial bounds for the grid-minor theorem
C Chekuri, J Chuzhoy
Journal of the ACM (JACM) 63 (5), 1-65, 2016
1742016
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20