Publications (36)
A note on the Survivable Network Design Problem
Chandra Chekuri, Thapanapong Rukkanchanunt
Submodular Cost Allocation Problem and Applications
Chandra Chekuri, Alina Ene
Submodular Function Maximization in Parallel via the Multilinear Relaxation
Chandra Chekuri, Kent Quanrud
Computing minimum cuts in hypergraphs
Chandra Chekuri, Chao Xu
Large-Treewidth Graph Decompositions and Applications
Chandra Chekuri, Julia Chuzhoy
A note on approximate strengths of edges in a hypergraph
Chandra Chekuri, Chao Xu
Prize-Collecting Steiner Tree and Forest in Planar Graphs
Chandra Chekuri, Alina Ene, Nitish Korula
On the Set Multi-Cover Problem in Geometric Settings
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
Truthful Mechanisms via Greedy Iterative Packing
Chandra Chekuri, Iftah Gamzu
$\ell_1$-sparsity Approximation Bounds for Packing Integer Programs
Chandra Chekuri, Kent Quanrud, Manuel R. Torres
Longest Wait First for Broadcast Scheduling
Chandra Chekuri, Sungjin Im, Benjamin Moseley
Approximation algorithms for Euler genus and related problems
Chandra Chekuri, Anastasios Sidiropoulos
On Approximating Partial Set Cover and Generalizations
Chandra Chekuri, Kent Quanrud, Zhao Zhang
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
Chandra Chekuri, Jan Vondrák, Rico Zenklusen
Approximation Algorithms for Orienteering with Time Windows
Chandra Chekuri, Nitish Korula
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
Chandra Chekuri, Sungjin Im, Benjamin Moseley
LP Relaxation and Tree Packing for Minimum $k$-cuts
Chandra Chekuri, Kent Quanrud, Chao Xu
Perturbation Resilient Clustering for $k$-Center and Related Problems via LP Relaxations
Chandra Chekuri, Shalmoli Gupta
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Time
Chandra Chekuri, Kent Quanrud
Parallelizing greedy for submodular set function maximization in matroids and beyond
Chandra Chekuri, Kent Quanrud
Streaming Algorithms for Submodular Function Maximization
Chandra Chekuri, Shalmoli Gupta, Kent Quanrud
Online Scheduling to Minimize the Maximum Delay Factor
Chandra Chekuri, Benjamin Moseley
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
Chandra Chekuri, Vivek Madan
Maximum Edge-Disjoint Paths in $k$-sums of Graphs
Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd
Flow-Cut Gaps for Integer and Fractional Multiflows
Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
Polynomial Bounds for the Grid-Minor Theorem
Chandra Chekuri, Julia Chuzhoy
Approximation Algorithms for Submodular Multiway Partition
Chandra Chekuri, Alina Ene
Dependent Randomized Rounding for Matroid Polytopes and Applications
Chandra Chekuri, Jan Vondrak, Rico Zenklusen
Degree-3 Treewidth Sparsifiers
Chandra Chekuri, Julia Chuzhoy
Approximability of Capacitated Network Design
Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna +1
Min-Cost 2-Connected Subgraphs With k Terminals
Chandra Chekuri, Nitish Korula
Approximating Multicut and the Demand Graph
Chandra Chekuri, Vivek Madan
Multicommodity Flows and Cuts in Polymatroidal Networks
Chandra Chekuri, Sreeram Kannan, Adnan Raja +1
A Graph Reduction Step Preserving Element-Connectivity and Applications
Chandra Chekuri, Nitish Korula
On Approximating (Sparse) Covering Integer Programs
Chandra Chekuri, Kent Quanrud
Fast Approximations for Metric-TSP via Linear Programming
Chandra Chekuri, Kent Quanrud