☰

Chandra Chekuri

Affiliations: 
University of Illinois, Urbana-Champaign, Urbana-Champaign, IL 
Area:
Computer Science
Google:
"Chandra Chekuri"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor
Rajeev Motwani grad student 1998 Stanford
 (Approximation Algorithms for Scheduling Problems)

Children

Sign in to add trainee
Nitish J. Korula grad student 2010 UIUC
Sungjin Im grad student 2012 UIUC
Benjamin J. Moseley grad student 2012 UIUC
Alina R. Ene grad student 2013 UIUC

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Chekuri C, Quanrud K, Xu C. (2020) LP Relaxation and Tree Packing for Minimum $k$-Cut Siam Journal On Discrete Mathematics. 34: 1334-1353
Chekuri C, Quanrud K, Torres MR. (2020) \(\ell _1\)-sparsity Approximation Bounds for Packing Integer Programs Mathematical Programming. 183: 195-214
Chekuri C, Ene A, Pilipczuk M. (2018) Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs Siam Journal On Discrete Mathematics. 32: 2134-2160
Chekuri C, Quanrud K. (2016) A fast approximation for maximum weight matroid intersection Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1: 445-457
Chekuri C, Madan V. (2016) Constant factor approximation for subset feedback set problems via a new LP relaxation Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2: 808-820
Chekuri C, Jayram TS, Vondrák J. (2015) On multiplicative weight updates for concave and submodular function maximization [extended abstract] Itcs 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. 201-210
Chekuri C, Kamath S, Kannan S, et al. (2015) Delay-constrained unicast and the triangle-cast problem Ieee International Symposium On Information Theory - Proceedings. 2015: 804-808
An HC, Bhaskara A, Chekuri C, et al. (2015) Centrality of trees for capacitated k-center Mathematical Programming. 154: 29-53
Chekuri C, Ene A. (2015) The all-or-nothing flow problem in directed graphs with symmetric demand pairs Mathematical Programming. 154: 249-272
Chakrabarty D, Chekuri C, Khanna S, et al. (2015) Approximability of Capacitated Network Design Algorithmica. 72: 493-514
See more...