C
Chandra Chekuri
Researcher at University of Illinois at Urbana–Champaign
Publications - 252
Citations - 13378
Chandra Chekuri is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Approximation algorithm & Submodular set function. The author has an hindex of 57, co-authored 234 publications receiving 12401 citations. Previous affiliations of Chandra Chekuri include Stanford University & Alcatel-Lucent.
Papers
More filters
Journal ArticleDOI
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
TL;DR: An improved coating pan apparatus and spray arm assembly are disclosed for providing facilitated maintenance and cleaning of sensitive spray nozzles.
Proceedings ArticleDOI
Approximation algorithms for directed Steiner problems
TL;DR: The first non-trivial approximation algorithms for the Steiner Tree problem and the Generalized Steiner tree problem in general directed graphs are obtained.
Proceedings ArticleDOI
Incremental clustering and dynamic information retrieval
TL;DR: This work considers the problem of clustering dynamic point sets in a metric space and proposes a model called incremental clustering which is based on a careful analysis of the requirements of the information retrieval application, and which should also be useful in other applications.
Proceedings Article
Maximizing a Submodular Set Function subject to a Matroid Constraint
TL;DR: The generalized assignment problem (GAP) is a special case of the problem, and although the reduction requires |N| to be exponential in the original problem size, it is able to interpret the recent (1 i¾? 1/e)-approximation for GAP by Fleischer et al.[10] in the framework.
Journal ArticleDOI
Approximation Algorithms for Directed Steiner Problems
TL;DR: In this article, the first nontrivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs were given, achieving an approximation ratio of O(i?1)k1/i in time O(nik2i) where k is the number of terminals.