Chandra Chekuri

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 85

Top Venues

Publications

Chandra Chekuri, Rhea Jain
Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing. CoRR (2024)
Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn
Adaptive Out-Orientations with Applications. SODA (2024)
Anya Chaturvedi, Chandra Chekuri, Mengxue Liu, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber
Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands. IEEE/ACM Trans. Netw. 32 (2) (2024)
Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. CoRR (2024)
Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta
1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. AAAI (2024)
Chandra Chekuri, Rhea Jain
Approximation Algorithms for Network Design in Non-Uniform Fault Models. CoRR (2024)
Chandra Chekuri, Junkai Song, Weizhong Zhang
-fold union of a matroid via the correlation gap. SOSA (2024)
Chandra Chekuri, Junkai Song
-Supplier. CoRR (2024)
Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR (2023)
Tanvi Bajpai, Chandra Chekuri
Bicriteria Approximation Algorithms for Priority Matroid Median. APPROX/RANDOM (2023)
Chandra Chekuri, Kent Quanrud
Independent Sets in Elimination Graphs with a Submodular Objective. APPROX/RANDOM (2023)
Chandra Chekuri, Kent Quanrud
Independent Sets in Elimination Graphs with a Submodular Objective. CoRR (2023)
Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta
1/2 Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. CoRR (2023)
Elfarouk Harb, Kent Quanrud, Chandra Chekuri
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. ESA (2023)
Karthekeyan Chandrasekaran, Chandra Chekuri
Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. Comb. 43 (3) (2023)
Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn
Adaptive Out-Orientations with Applications. CoRR (2023)
Elfarouk Harb, Kent Quanrud, Chandra Chekuri
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. CoRR (2023)
Chandra Chekuri, Rhea Jain
Approximation Algorithms for Network Design in Non-Uniform Fault Models. ICALP (2023)
Chandra Chekuri, Manuel R. Torres
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. CoRR (2023)
Caleb Ju, Serif Yesil, Mengyuan Sun, Chandra Chekuri, Edgar Solomonik
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs. CoRR (2023)
Chandra Chekuri, Tanmay Inamdar
Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory Comput. 18 (2022)
Chandra Chekuri, Rhea Jain
Approximating Flexible Graph Connectivity via Räcke Tree based Rounding. CoRR (2022)
Chandra Chekuri, Rhea Jain
Augmentation based Approximation Algorithms for Flexible Network Design. CoRR (2022)
Elfarouk Harb, Kent Quanrud, Chandra Chekuri
Faster and Scalable Algorithms for Densest Subgraph and Decomposition. NeurIPS (2022)
Anya Chaturvedi, Chandra Chekuri, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands. SIGMETRICS Perform. Evaluation Rev. 49 (3) (2022)
Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, Zhao Zhang
Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim. 44 (2) (2022)
Chandra Chekuri, Kent Quanrud, Manuel R. Torres
Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. SODA (2022)
Chandra Chekuri, Kent Quanrud
(1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time. CoRR (2022)
Tanvi Bajpai, Chandra Chekuri
Bicriteria Approximation Algorithms for Priority Matroid Median. CoRR (2022)
Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS (2022)
Karthekeyan Chandrasekaran, Chandra Chekuri
in Deterministic Polynomial Time. Math. Oper. Res. 47 (4) (2022)
Karthekeyan Chandrasekaran, Chandra Chekuri
Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. SODA (2021)
Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani
Revisiting Priority k-Center: Fairness and Outliers. ICALP (2021)
Chandra Chekuri, Vasilis Livanos
On Submodular Prophet Inequalities and Correlation Gap. CoRR (2021)
Chandra Chekuri, Kent Quanrud
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems. CoRR (2021)
Chandra Chekuri, Alina Ene, Ali Vakilian
Node-weighted Network Design in Planar and Minor-closed Families of Graphs. ACM Trans. Algorithms 17 (2) (2021)
Chandra Chekuri, Vasilis Livanos
On Submodular Prophet Inequalities and Correlation Gap. SAGT (2021)
Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani
Revisiting Priority k-Center: Fairness and Outliers. CoRR (2021)
Chandra Chekuri, Kent Quanrud
Faster Algorithms for Rooted Connectivity in Directed Graphs. CoRR (2021)
Chandra Chekuri, Kent Quanrud, Manuel R. Torres
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. APPROX-RANDOM (2021)
Chandra Chekuri, Kent Quanrud
Faster Algorithms for Rooted Connectivity in Directed Graphs. ICALP (2021)
Chandra Chekuri, Kent Quanrud
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. ICALP (2021)
Chandra Chekuri, Kent Quanrud, Manuel R. Torres
-Sparsity approximation bounds for packing integer programs. Math. Program. 183 (1) (2020)
Karthekeyan Chandrasekaran, Chandra Chekuri
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. FOCS (2020)
Chandra Chekuri, Kent Quanrud, Chao Xu
LP Relaxation and Tree Packing for Minimum k-Cut. SIAM J. Discret. Math. 34 (2) (2020)
Chandra Chekuri, Shi Li
On the Hardness of Approximating the k-Way Hypergraph Cut problem. Theory Comput. 16 (2020)
Karthekeyan Chandrasekaran, Chandra Chekuri
Hypergraph k-cut for fixed k in deterministic polynomial time. CoRR (2020)
Chandra Chekuri, Sariel Har-Peled, Kent Quanrud
Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA (2020)
Chandra Chekuri, Kent Quanrud, Manuel R. Torres
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. CoRR (2020)
Chandra Chekuri, Kent Quanrud
Submodular Function Maximization in Parallel via the Multilinear Relaxation. SODA (2019)
Chandra Chekuri, Kent Quanrud, Chao Xu
LP Relaxation and Tree Packing for Minimum k-cuts. SOSA (2019)
Chandra Chekuri, Kent Quanrud, Manuel R. Torres
\ell _1 -sparsity Approximation Bounds for Packing Integer Programs. IPCO (2019)
Chandra Chekuri, Kent Quanrud
Parallelizing greedy for submodular set function maximization in matroids and beyond. STOC (2019)
Chandra Chekuri, Kent Quanrud, Manuel R. Torres
$\ell_1$-sparsity Approximation Bounds for Packing Integer Programs. CoRR (2019)
Chandra Chekuri, Kent Quanrud
On Approximating (Sparse) Covering Integer Programs. SODA (2019)
Chandra Chekuri, Kent Quanrud, Zhao Zhang
On Approximating Partial Set Cover and Generalizations. CoRR (2019)
Chandra Chekuri, Tanmay Inamdar
Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks. CoRR (2019)
Chandra Chekuri, Alina Ene, Ali Vakilian
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. CoRR (2019)
Chandra Chekuri, Kent Quanrud
Submodular Function Maximization in Parallel via the Multilinear Relaxation. CoRR (2018)
Chandra Chekuri, Kent Quanrud
Fast Approximations for Metric-TSP via Linear Programming. CoRR (2018)
Chandra Chekuri, Alina Ene, Marcin Pilipczuk
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. SIAM J. Discret. Math. 32 (3) (2018)
Chandra Chekuri, Chao Xu
Minimum Cuts and Sparsification in Hypergraphs. SIAM J. Comput. 47 (6) (2018)
Chandra Chekuri, Kent Quanrud, Chao Xu
LP Relaxation and Tree Packing for Minimum k-cuts. CoRR (2018)
Chandra Chekuri, Anastasios Sidiropoulos
Approximation Algorithms for Euler Genus and Related Problems. SIAM J. Comput. 47 (4) (2018)
Chandra Chekuri, Shalmoli Gupta
Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations. APPROX-RANDOM (2018)
Chandra Chekuri, Thapanapong Rukkanchanunt
A Note on Iterated Rounding for the Survivable Network Design Problem. SOSA (2018)
Chandra Chekuri, Shalmoli Gupta
Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations. CoRR (2018)
Chandra Chekuri, Kent Quanrud
On Approximating (Sparse) Covering Integer Programs. CoRR (2018)
Chandra Chekuri, Kent Quanrud
Parallelizing greedy for submodular set function maximization in matroids and beyond. CoRR (2018)
Chandra Chekuri, Mark Idleman
Congestion Minimization for Multipath Routing via Multiroute Flows. SOSA (2018)
Chandra Chekuri, Kent Quanrud
Randomized MWU for Positive LPs. SODA (2018)
Chandra Chekuri, Vivek Madan
Approximating Multicut and the Demand Graph. SODA (2017)
Chandra Chekuri, Chao Xu
A note on approximate strengths of edges in a hypergraph. CoRR (2017)
Chandra Chekuri, Kent Quanrud
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. FOCS (2017)
Chandra Chekuri, Kent Quanrud
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. CoRR (2017)
Chandra Chekuri, Chao Xu
Computing minimum cuts in hypergraphs. SODA (2017)
Chandra Chekuri, Kent Quanrud
Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. SODA (2017)
Chandra Chekuri, Thapanapong Rukkanchanunt
A note on the Survivable Network Design Problem. CoRR (2016)
Chandra Chekuri, Alina Ene, Marcin Pilipczuk
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. ICALP (2016)
Chandra Chekuri, Vivek Madan
Approximating Multicut and the Demand Graph. CoRR (2016)
Chandra Chekuri, Vivek Madan
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. SODA (2016)
Chandra Chekuri, Chao Xu
Computing minimum cuts in hypergraphs. CoRR (2016)
Chandra Chekuri, Kent Quanrud
A Fast Approximation for Maximum Weight Matroid Intersection. SODA (2016)
Chandra Chekuri, Julia Chuzhoy
Polynomial Bounds for the Grid-Minor Theorem. J. ACM 63 (5) (2016)
Chandra Chekuri, Vivek Madan
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation. SODA (2016)
Chandra Chekuri, Alina Ene
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program. 154 (1-2) (2015)
Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
Centrality of trees for capacitated k-center. Math. Program. 154 (1-2) (2015)
Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu
On Element-Connectivity Preserving Graph Simplification. ESA (2015)
Chandra Chekuri, Julia Chuzhoy
Degree-3 Treewidth Sparsifiers. SODA (2015)
Chandra Chekuri, Vivek Madan
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. CoRR (2015)
Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
Approximability of Capacitated Network Design. Algorithmica 72 (2) (2015)
Chandra Chekuri, T. S. Jayram, Jan Vondrák
On Multiplicative Weight Updates for Concave and Submodular Function Maximization. ITCS (2015)
Chandra Chekuri, Shalmoli Gupta, Kent Quanrud
Streaming Algorithms for Submodular Function Maximization. ICALP (1) (2015)
Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath
Multicommodity Flows and Cuts in Polymatroidal Networks. SIAM J. Comput. 44 (4) (2015)
Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath
Delay-constrained unicast and the triangle-cast problem. ISIT (2015)
Chandra Chekuri, Shalmoli Gupta, Kent Quanrud
Streaming Algorithms for Submodular Function Maximization. CoRR (2015)
Chandra Chekuri, Nitish Korula
A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests. SIAM J. Discret. Math. 28 (2) (2014)
Chandra Chekuri, Alina Ene
The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. IPCO (2014)
Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
Centrality of Trees for Capacitated k-Center. IPCO (2014)
Chandra Chekuri, Julia Chuzhoy
Degree-3 Treewidth Sparsifiers. CoRR (2014)

Chandra Chekuri.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Chandra Chekuri