Chandra Chekuri

Computational Theory and Mathematics · 1997–2011

A researcher in the Science corpus: 6 papers; trusts 17 researchers and is trusted by 24 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 18 citations into it; #1,860 of 12,182 by trust here, #2,419 by citations
• Optimization & Training — 9 citations into it
• Computer Graphics and Computer-Aided Design — 8 citations into it; #654 of 1,584 by trust here, #1,205 by citations
• Computer Networks and Communications — 7 citations into it; #2,226 of 9,886 by trust here, #3,638 by citations
• Artificial Intelligence — 5 citations into it; #11,631 of 35,345 by trust here, #15,236 by citations

Whom Chandra Chekuri trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. George L. Nemhauser
2. Uriel Feige
3. Maxim Sviridenko
4. Alexander A. Ageev
5. Jan Vondr'ak
6. Laurence A. Wolsey
7. Gruia Calinescu
8. Shayan Oveis Gharan
9. Marshall L. Fisher
10. Alexander Schrijver

Who trusts Chandra Chekuri overall

1. Jan Vondr'ak
2. Gruia Calinescu
3. Aranyak Mehta
4. Francis R. Bach
5. Ashwinkumar Badanidiyuru
6. Alex Kulesza
7. Moran Feldman
8. Niv Buchbinder
9. Rahaf Aljundi
10. Maxim Sviridenko

Papers from Chandra Chekuri's perspective

Ordered by how strongly the researchers Chandra Chekuri trusts endorse each paper. Same corpus, a different order for every researcher.

1. A threshold of ln n for approximating set cover (preliminary version)
2. An analysis of approximations for maximizing submodular set functions—I
3. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
4. Submodular functions and convexity
5. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee (Journal of combinatorial optimization)
6. Non-monotone submodular maximization under matroid and knapsack constraints
7. Maximizing Non-Monotone Submodular Functions
8. The Probabilistic Method, Second Edition
9. On maximizing welfare when utility functions are subadditive (Symposium on the Theory of Computing)
10. A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (SIAM journal on computing (Print))

Their papers

• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (2007) — 478 citations
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint (2011) — 919 citations
• Submodular function maximization via the multilinear relaxation and contention resolution schemes (2011) — 394 citations
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (2005) — 348 citations
• A PTAS for the multiple knapsack problem (2000) — 303 citations
• Incremental clustering and dynamic information retrieval (1997)