Maximizing a monotone submodular function subject to a matroid constraint. Zbl 1234.68459
Calinescu, Gruia; Chekuri, Chandra; Pál, Martin; Vondrák, Jan |
|
2011
|
Fast estimation of diameter and shortest paths (Without matrix multiplication). Zbl 0926.68093
Aingworth, D.; Chekuri, C.; Indyk, P.; Motwani, R. |
|
1999
|
A polynomial time approximation scheme for the multiple knapsack problem. Zbl 1095.68035
Chekuri, Chandra; Khanna, Sanjeev |
|
2006
|
Approximation algorithms for directed Steiner problems. Zbl 0937.68155
Charikar, Moses; Chekuri, Chandra; Cheung, To-yat; Dai, Zuo; Goel, Ashish; Guha, Sudipto; Li, Ming |
|
1999
|
Submodular function maximization via the multilinear relaxation and contention resolution schemes. Zbl 1437.90135
Chekuri, Chandra; Vondrák, Jan; Zenklusen, Rico |
|
2014
|
Maximizing a submodular set function subject to a matroid constraint (extended abstract). Zbl 1136.90449
Calinescu, Gruia; Chekuri, Chandra; Pál, Martin; Vondrák, Jan |
|
2007
|
Approximation techniques for average completion time scheduling. Zbl 0992.68066
Chekuri, C.; Motwani, R.; Natarajan, B.; Stein, C. |
|
2001
|
Conjunctive query containment revisited. Zbl 0944.68046
Chekuri, C.; Rajaraman, A. |
|
2000
|
Submodular function maximization via the multilinear relaxation and contention resolution schemes. Zbl 1288.90081
Vondrák, Jan; Chekuri, Chandra; Zenklusen, Rico |
|
2011
|
Incremental clustering and dynamic information retrieval. Zbl 1101.68605
Charikar, Moses; Chekuri, Chandra; Feder, Tomas; Motwani, Rajeev |
|
2004
|
Maximum coverage problem with group budget constraints and applications. Zbl 1106.90062
Chekuri, Chandra; Kumar, Amit |
|
2004
|
Multicommodity demand flow in a tree and packing integer programs. Zbl 1192.68879
Chekuri, Chandra; Mydlarz, Marcelo; Shepherd, F. Bruce |
|
2007
|
Multi-budgeted matchings and matroid intersection via dependent rounding. Zbl 1377.90071
Chekuri, Chandra; Vondrák, Jan; Zenklusen, Rico |
|
2011
|
Polynomial bounds for the grid-minor theorem. Zbl 1410.05186
Chekuri, Chandra; Chuzhoy, Julia |
|
2016
|
On multidimensional packing problems. Zbl 1101.68606
Chekuri, Chandra; Khanna, Sanjeev |
|
2004
|
Algorithms for minimizing weighted flow time. Zbl 1323.90019
Chekuri, Chandra; Khanna, Sanjeev; Zhu, An |
|
2001
|
Polynomial bounds for the grid-minor theorem. Zbl 1315.05131
Chekuri, Chandra; Chuzhoy, Julia |
|
2014
|
Hardness of robust network design. Zbl 1119.90005
Chekuri, C.; Shepherd, F. B.; Oriolo, G.; Scutellá, M. G. |
|
2007
|
Submodular function maximization in parallel via the multilinear relaxation. Zbl 1431.68148
Chekuri, Chandra; Quanrud, Kent |
|
2019
|
A PTAS for the multiple knapsack problem. Zbl 0952.90020
Chekuri, Chandra; Khanna, Sanjeev |
|
2000
|
An \(O(\sqrt{n})\) approximation and integrality gap for disjoint paths and unsplittable flow. Zbl 1213.68700
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2006
|
Rounding via trees: Deterministic approximation algorithms for group Steiner trees and \(k\)-median. Zbl 1028.68223
Charikar, Moses; Chekuri, Chandra; Goel, Ashish; Guha, Sudipto |
|
1998
|
Streaming algorithms for submodular function maximization. Zbl 1409.68340
Chekuri, Chandra; Gupta, Shalmoli; Quanrud, Kent |
|
2015
|
Multicommodity flow, well-linked terminals, and routing problems. Zbl 1192.90017
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2005
|
Improved algorithms for orienteering and related problems. Zbl 1295.05225
Chekuri, Chandra; Korula, Nitish; Pál, Martin |
|
2012
|
Approximation algorithms for the unsplittable flow problem. Zbl 1107.68120
Chakrabarti, Amit; Chekuri, Chandra; Gupta, Anupam; Kumar, Amit |
|
2007
|
Centrality of trees for capacitated \(k\)-center. Zbl 1337.90036
An, Hyung-Chan; Bhaskara, Aditya; Chekuri, Chandra; Gupta, Shalmoli; Madan, Vivek; Svensson, Ola |
|
2015
|
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Zbl 1009.90053
Chekuri, Chandra; Motwani, Rajeev |
|
1999
|
Performance guarantees for the TSP with a parameterized triangle inequality. Zbl 1338.68288
Bender, Michael A.; Chekuri, Chandra |
|
2000
|
On the set multicover problem in geometric settings. Zbl 1301.68237
Chekuri, Chandra; Clarkson, Kenneth L.; Har-Peled, Sariel |
|
2012
|
Incremental clustering and dynamic information retrieval. Zbl 0963.68062
Charikar, Moses; Chekuri, Chandra; Feder, Tomás; Motwani, Rajeev |
|
1999
|
Large-treewidth graph decompositions and applications. Zbl 1293.05040
Chekuri, Chandra; Chuzhoy, Julia |
|
2013
|
A graph reduction step preserving element-connectivity and applications. Zbl 1247.05236
Chekuri, Chandra; Korula, Nitish |
|
2009
|
Unsplittable flow in paths and trees and column-restricted packing integer programs. Zbl 1254.68353
Chekuri, Chandra; Ene, Alina; Korula, Nitish |
|
2009
|
Approximation algorithms for directed Steiner problems. Zbl 0930.68107
Charikar, Moses; Chekuri, Chandra; Cheung, To-yat; Dai, Zuo; Goel, Ashish; Guha, Sudipto; Li, Ming |
|
1998
|
On multi-dimensional packing problems. Zbl 0938.68067
Chekuri, Chandra; Khanna, Sanjeev |
|
1999
|
Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation. Zbl 1192.68096
Chekuri, Chandra; Goel, Ashish; Khanna, Sanjeev; Kumar, Amit |
|
2004
|
A linear programming formulation and approximation algorithms for the metric labeling problem. Zbl 1077.68036
Chekuri, C.; Khanna, S.; Naor, J.; Zosin, L. |
|
2005
|
Edge disjoint paths revisited. Zbl 1092.68620
Chekuri, Chandra; Khanna, Sanjeev |
|
2003
|
Embedding \(k\)-outerplanar graphs into \(\ell_1\). Zbl 1111.05022
Chekuri, Chandra; Gupta, Anupam; Newman, Ilan; Rabinovich, Yuri; Sinclair, Alistair |
|
2006
|
Approximation schemes for preemptive weighted flow time. Zbl 1192.68877
Chekuri, Chandra; Khanna, Sanjeev |
|
2002
|
On multiplicative weight updates for concave and submodular function maximization. Zbl 1365.90225
Chekuri, Chandra; Jayram, T. S.; Vondrak, Jan |
|
2015
|
A greedy approximation algorithm for the group Steiner problem. Zbl 1083.68089
Chekuri, Chandra; Even, Guy; Kortsarz, Guy |
|
2006
|
Set connectivity problems in undirected graphs and the directed Steiner network problem. Zbl 1295.68211
Chekuri, Chandra; Even, Guy; Gupta, Anupam; Segev, Danny |
|
2011
|
The all-or-nothing multicommodity flow problem. Zbl 1192.68878
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2004
|
Improved algorithms for orienteering and related problems. Zbl 1192.90162
Chekuri, Chandra; Korula, Nitish; Pál, Martin |
|
2008
|
Edge-disjoint paths in planar graphs with constant congestion. Zbl 1301.68268
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2006
|
Approximation algorithms for node-weighted buy-at-bulk network design. Zbl 1302.90028
Chekuri, C.; Hajiaghayi, M. T.; Kortsarz, G.; Salavatipour, M. R. |
|
2007
|
Approximation algorithms for submodular multiway partition. Zbl 1292.68163
Chekuri, Chandra; Ene, Alina |
|
2011
|
Approximation algorithms for nonuniform buy-at-bulk network design. Zbl 1207.90019
Chekuri, C.; Hajiaghayi, M. T.; Kortsarz, G.; Salavatipour, M. R. |
|
2010
|
Poly-logarithmic approximation for maximum node disjoint paths with constant congestion. Zbl 1421.68200
Chekuri, Chandra; Ene, Alina |
|
2013
|
LP relaxation and tree packing for minimum \(k\)-cut. Zbl 1444.05113
Chekuri, Chandra; Quanrud, Kent; Xu, Chao |
|
2020
|
Edge-disjoint paths in planar graphs with constant congestion. Zbl 1185.68848
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2009
|
Prize-collecting Steiner problems on planar graphs. Zbl 1376.68059
Bateni, M.; Chekuri, C.; Ene, A.; Hajiaghayi, M. T.; Korula, N.; Marx, D. |
|
2011
|
Experimental study of minimum cut algorithms. Zbl 1321.05254
Chekuri, Chandra S.; Goldberg, Andrew V.; Karger, David R.; Levine, Matthew S.; Stein, Cliff |
|
1997
|
The Steiner \(k\)-cut problem. Zbl 1107.68121
Chekuri, Chandra; Guha, Sudipto; Naor, Joseph |
|
2006
|
Sampling bounds for stochastic optimization. Zbl 1142.90459
Charikar, Moses; Chekuri, Chandra; Pál, Martin |
|
2005
|
Parallelizing greedy for submodular set function maximization in matroids and beyond. Zbl 1433.68591
Chekuri, Chandra; Quanrud, Kent |
|
2019
|
A PTAS for minimizing weighted completion time on uniformly related machines (extended abstract). Zbl 0986.68503
Chekuri, Chandra; Khanna, Sanjeev |
|
2001
|
Approximation techniques for average completion time scheduling. Zbl 1321.68496
Chekuri, C.; Motwani, R.; Natarajan, B.; Stien, C. |
|
1997
|
An efficient approximation algorithm for minimizing makespan on uniformly related machines. Zbl 1051.68150
Chekuri, Chandra; Bender, Michael |
|
2001
|
Prize-collecting survivable network design in node-weighted graphs. Zbl 1372.68206
Chekuri, Chandra; Ene, Alina; Vakilian, Ali |
|
2012
|
The all-or-nothing multicommodity flow problem. Zbl 1290.68054
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2013
|
Flow-cut gaps for integer and fractional multiflows. Zbl 1262.05072
Chekuri, Chandra; Shepherd, F. Bruce; Weibel, Christophe |
|
2013
|
Degree-3 treewidth sparsifiers. Zbl 1371.05281
Chekuri, Chandra; Chuzhoy, Julia |
|
2015
|
On approximating (sparse) covering integer programs. Zbl 1431.68149
Chekuri, Chandra; Quanrud, Kent |
|
2019
|
Approximability of capacitated network design. Zbl 1327.90023
Chakrabarty, Deeparnab; Chekuri, Chandra; Khanna, Sanjeev; Korula, Nitish |
|
2015
|
Multicommodity demand flow in a tree. Zbl 1060.90511
Chekuri, Chandra; Mydlarz, Marcelo; Shepherd, F. Bruce |
|
2003
|
A deterministic algorithm for the cost-distance problem. Zbl 1015.90009
Chekuri, Chandra; Khanna, Sanjeev; Naor, Joseph |
|
2001
|
Submodular cost allocation problem and applications. Zbl 1333.90092
Chekuri, Chandra; Ene, Alina |
|
2011
|
Approximation algorithms for the metric labeling problem via a new linear programming formulation. Zbl 0989.90104
Chekuri, Chandra; Khanna, Sanjeev; Naor, Joseph; Zosin, Leonid |
|
2001
|
Computing minimum cuts in hypergraphs. Zbl 1410.05198
Chekuri, Chandra; Xu, Chao |
|
2017
|
Minimum cuts and sparsification in hypergraphs. Zbl 1409.90156
Chekuri, Chandra; Xu, Chao |
|
2018
|
Embedding \(k\)-outerplanar graphs into \(\ell_1\). Zbl 1092.68619
Chekuri, Chandra; Gupta, Anupam; Newman, Ilan; Rabinovich, Yuri; Sinclair, Alistair |
|
2003
|
Truthful mechanisms via greedy iterative packing. Zbl 1254.68354
Chekuri, Chandra; Gamzu, Iftah |
|
2009
|
Constant factor approximation for subset feedback set problems via a new LP relaxation. Zbl 1410.68288
Chekuri, Chandra; Madan, Vivek |
|
2016
|
Approximation algorithms for Euler genus and related problems. Zbl 1398.68663
Chekuri, Chandra; Sidiropoulos, Anastasios |
|
2018
|
Min-max partitioning of hypergraphs and symmetric submodular functions. Zbl 07788402
Chandrasekaran, Karthekeyan; Chekuri, Chandra |
|
2021
|
Performance guarantees for the TSP with a parametrized triangle inequality. Zbl 1063.68700
Bender, Michael A.; Chekuri, Chandra |
|
1999
|
Maximum edge-disjoint paths in \(k\)-sums of graphs. Zbl 1336.68291
Chekuri, Chandra; Naves, Guyslain; Shepherd, F. Bruce |
|
2013
|
Single-sink network design with vertex connectivity requirements. Zbl 1248.68059
Chekuri, Chandra; Korula, Nitish |
|
2008
|
Fast estimation of diameter and shortest paths (without matrix multiplication). Zbl 0849.68094
Aingworth, D.; Chekuri, C.; Motwani, R. |
|
1996
|
Approximability of capacitated network design. Zbl 1339.90321
Chakrabarty, Deeparnab; Chekuri, Chandra; Khanna, Sanjeev; Korula, Nitish |
|
2011
|
Approximation algorithms for the unsplittable flow problem. Zbl 1013.90112
Chakrabarti, Amit; Chekuri, Chandra; Gupta, Anupam; Kumar, Amit |
|
2002
|
Randomized MWU for positive LPs. Zbl 1403.68332
Chekuri, Chandra; Quanrud, Kent |
|
2018
|
Near-linear time approximation schemes for some implicit fractional packing problems. Zbl 1422.90043
Chekuri, Chandra; Quanrud, Kent |
|
2017
|
Centrality of trees for capacitated \(k\)-center. Zbl 1333.90067
An, Hyung-Chan; Bhaskara, Aditya; Chekuri, Chandra; Gupta, Shalmoli; Madan, Vivek; Svensson, Ola |
|
2014
|
Perturbation resilient clustering for k-center and related problems via LP relaxations. Zbl 1521.68269
Chekuri, Chandra; Gupta, Shalmoli |
|
2018
|
A note on multiflows and treewidth. Zbl 1176.90600
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2009
|
Set connectivity problems in undirected graphs and the directed Steiner network problem. Zbl 1192.68030
Chekuri, Chandra; Even, Guy; Gupta, Anupam; Segev, Danny |
|
2008
|
An \(O(\log n)\) approximation ratio for the asymmetric traveling salesman path problem. Zbl 1213.68701
Chekuri, Chandra; Pál, Martin |
|
2007
|
On the set multi-cover problem in geometric settings. Zbl 1388.68286
Chekuri, Chandra; Clarkson, Kenneth L.; Har-Peled, Sariel |
|
2009
|
Approximating multicut and the demand graph. Zbl 1410.90232
Chekuri, Chandra; Madan, Vivek |
|
2017
|
Flow-cut gaps for integer and fractional multiflows. Zbl 1288.05119
Chekuri, Chandra; Shepherd, F. Bruce; Weibel, Christophe |
|
2010
|
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Zbl 1337.90018
Chekuri, Chandra; Ene, Alina |
|
2015
|
Node-weighted network design in planar and minor-closed families of graphs. Zbl 1272.68331
Chekuri, Chandra; Ene, Alina; Vakilian, Ali |
|
2012
|
On the hardness of approximating the \(k\)-Way Hypergraph Cut problem. Zbl 1462.68066
Chekuri, Chandra; Li, Shi |
|
2020
|
Buy-at-bulk network design with protection. Zbl 1216.68336
Antonakopoulos, Spyridon; Chekuri, Chandra; Shepherd, Bruce; Zhang, Lisa |
|
2011
|
Constant congestion routing of symmetric demands in planar directed graphs. Zbl 1388.68213
Chekuri, Chandra; Ene, Alina; Pilipczuk, Marcin |
|
2016
|
On element-connectivity preserving graph simplification. Zbl 1466.68056
Chekuri, Chandra; Rukkanchanunt, Thapanapong; Xu, Chao |
|
2015
|
Hypergraph \(k\)-cut for fixed \(k\) in deterministic polynomial time. Zbl 07639674
Chandrasekaran, Karthekeyan; Chekuri, Chandra |
|
2022
|
Algorithms for covering multiple submodular constraints and applications. Zbl 1497.90165
Chekuri, Chandra; Inamdar, Tanmay; Quanrud, Kent; Varadarajan, Kasturi; Zhang, Zhao |
|
2022
|
Min-max partitioning of hypergraphs and symmetric submodular functions. Zbl 07788402
Chandrasekaran, Karthekeyan; Chekuri, Chandra |
|
2021
|
Densest subgraph: supermodularity, iterative peeling, and flow. Zbl 07883645
Chekuri, Chandra; Quanrud, Kent; Torres, Manuel R. |
|
2021
|
LP relaxation and tree packing for minimum \(k\)-cut. Zbl 1444.05113
Chekuri, Chandra; Quanrud, Kent; Xu, Chao |
|
2020
|
On the hardness of approximating the \(k\)-Way Hypergraph Cut problem. Zbl 1462.68066
Chekuri, Chandra; Li, Shi |
|
2020
|
Fast LP-based approximations for geometric packing and covering problems. Zbl 07304085
Chekuri, Chandra; Har-Peled, Sariel; Quanrud, Kent |
|
2020
|
Submodular function maximization in parallel via the multilinear relaxation. Zbl 1431.68148
Chekuri, Chandra; Quanrud, Kent |
|
2019
|
Parallelizing greedy for submodular set function maximization in matroids and beyond. Zbl 1433.68591
Chekuri, Chandra; Quanrud, Kent |
|
2019
|
On approximating (sparse) covering integer programs. Zbl 1431.68149
Chekuri, Chandra; Quanrud, Kent |
|
2019
|
LP relaxation and tree packing for minimum \(k\)-cuts. Zbl 07902010
Chekuri, Chandra; Quanrud, Kent; Xu, Chao |
|
2019
|
\(\ell_1\)-sparsity approximation bounds for packing integer programs. Zbl 1436.90079
Chekuri, Chandra; Quanrud, Kent; Torres, Manuel R. |
|
2019
|
Minimum cuts and sparsification in hypergraphs. Zbl 1409.90156
Chekuri, Chandra; Xu, Chao |
|
2018
|
Approximation algorithms for Euler genus and related problems. Zbl 1398.68663
Chekuri, Chandra; Sidiropoulos, Anastasios |
|
2018
|
Randomized MWU for positive LPs. Zbl 1403.68332
Chekuri, Chandra; Quanrud, Kent |
|
2018
|
Perturbation resilient clustering for k-center and related problems via LP relaxations. Zbl 1521.68269
Chekuri, Chandra; Gupta, Shalmoli |
|
2018
|
Constant congestion routing of symmetric demands in planar directed graphs. Zbl 1398.68391
Chekuri, Chandra; Ene, Alina; Pilipczuk, Marcin |
|
2018
|
Computing minimum cuts in hypergraphs. Zbl 1410.05198
Chekuri, Chandra; Xu, Chao |
|
2017
|
Near-linear time approximation schemes for some implicit fractional packing problems. Zbl 1422.90043
Chekuri, Chandra; Quanrud, Kent |
|
2017
|
Approximating multicut and the demand graph. Zbl 1410.90232
Chekuri, Chandra; Madan, Vivek |
|
2017
|
Polynomial bounds for the grid-minor theorem. Zbl 1410.05186
Chekuri, Chandra; Chuzhoy, Julia |
|
2016
|
Constant factor approximation for subset feedback set problems via a new LP relaxation. Zbl 1410.68288
Chekuri, Chandra; Madan, Vivek |
|
2016
|
Constant congestion routing of symmetric demands in planar directed graphs. Zbl 1388.68213
Chekuri, Chandra; Ene, Alina; Pilipczuk, Marcin |
|
2016
|
A fast approximation for maximum weight matroid intersection. Zbl 1410.68398
Chekuri, Chandra; Quanrud, Kent |
|
2016
|
Simple and fast rounding algorithms for directed and node-weighted multiway cut. Zbl 1410.05197
Chekuri, Chandra; Madan, Vivek |
|
2016
|
Streaming algorithms for submodular function maximization. Zbl 1409.68340
Chekuri, Chandra; Gupta, Shalmoli; Quanrud, Kent |
|
2015
|
Centrality of trees for capacitated \(k\)-center. Zbl 1337.90036
An, Hyung-Chan; Bhaskara, Aditya; Chekuri, Chandra; Gupta, Shalmoli; Madan, Vivek; Svensson, Ola |
|
2015
|
On multiplicative weight updates for concave and submodular function maximization. Zbl 1365.90225
Chekuri, Chandra; Jayram, T. S.; Vondrak, Jan |
|
2015
|
Degree-3 treewidth sparsifiers. Zbl 1371.05281
Chekuri, Chandra; Chuzhoy, Julia |
|
2015
|
Approximability of capacitated network design. Zbl 1327.90023
Chakrabarty, Deeparnab; Chekuri, Chandra; Khanna, Sanjeev; Korula, Nitish |
|
2015
|
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Zbl 1337.90018
Chekuri, Chandra; Ene, Alina |
|
2015
|
On element-connectivity preserving graph simplification. Zbl 1466.68056
Chekuri, Chandra; Rukkanchanunt, Thapanapong; Xu, Chao |
|
2015
|
Multicommodity flows and cuts in polymatroidal networks. Zbl 1346.90698
Chekuri, Chandra; Kannan, Sreeram; Raja, Adnan; Viswanath, Pramod |
|
2015
|
Submodular function maximization via the multilinear relaxation and contention resolution schemes. Zbl 1437.90135
Chekuri, Chandra; Vondrák, Jan; Zenklusen, Rico |
|
2014
|
Polynomial bounds for the grid-minor theorem. Zbl 1315.05131
Chekuri, Chandra; Chuzhoy, Julia |
|
2014
|
Centrality of trees for capacitated \(k\)-center. Zbl 1333.90067
An, Hyung-Chan; Bhaskara, Aditya; Chekuri, Chandra; Gupta, Shalmoli; Madan, Vivek; Svensson, Ola |
|
2014
|
A graph reduction step preserving element-connectivity and packing Steiner trees and forests. Zbl 1302.05139
Chekuri, Chandra; Korula, Nitish |
|
2014
|
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Zbl 1418.90272
Chekuri, Chandra; Ene, Alina |
|
2014
|
Large-treewidth graph decompositions and applications. Zbl 1293.05040
Chekuri, Chandra; Chuzhoy, Julia |
|
2013
|
Poly-logarithmic approximation for maximum node disjoint paths with constant congestion. Zbl 1421.68200
Chekuri, Chandra; Ene, Alina |
|
2013
|
The all-or-nothing multicommodity flow problem. Zbl 1290.68054
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2013
|
Flow-cut gaps for integer and fractional multiflows. Zbl 1262.05072
Chekuri, Chandra; Shepherd, F. Bruce; Weibel, Christophe |
|
2013
|
Maximum edge-disjoint paths in \(k\)-sums of graphs. Zbl 1336.68291
Chekuri, Chandra; Naves, Guyslain; Shepherd, F. Bruce |
|
2013
|
Improved algorithms for orienteering and related problems. Zbl 1295.05225
Chekuri, Chandra; Korula, Nitish; Pál, Martin |
|
2012
|
On the set multicover problem in geometric settings. Zbl 1301.68237
Chekuri, Chandra; Clarkson, Kenneth L.; Har-Peled, Sariel |
|
2012
|
Prize-collecting survivable network design in node-weighted graphs. Zbl 1372.68206
Chekuri, Chandra; Ene, Alina; Vakilian, Ali |
|
2012
|
Node-weighted network design in planar and minor-closed families of graphs. Zbl 1272.68331
Chekuri, Chandra; Ene, Alina; Vakilian, Ali |
|
2012
|
Online scheduling to minimize maximum response time and maximum delay factor. Zbl 1260.68470
Chekuri, Chandra; Im, Sungjin; Moseley, Benjamin |
|
2012
|
Multicommodity flows and cuts in polymatroidal networks. Zbl 1347.68278
Chekuri, Chandra; Kannan, Sreeram; Raja, Adnan; Viswanath, Pramod |
|
2012
|
Pruning 2-connected graphs. Zbl 1241.68131
Chekuri, Chandra; Korula, Nitish |
|
2012
|
Maximizing a monotone submodular function subject to a matroid constraint. Zbl 1234.68459
Calinescu, Gruia; Chekuri, Chandra; Pál, Martin; Vondrák, Jan |
|
2011
|
Submodular function maximization via the multilinear relaxation and contention resolution schemes. Zbl 1288.90081
Vondrák, Jan; Chekuri, Chandra; Zenklusen, Rico |
|
2011
|
Multi-budgeted matchings and matroid intersection via dependent rounding. Zbl 1377.90071
Chekuri, Chandra; Vondrák, Jan; Zenklusen, Rico |
|
2011
|
Set connectivity problems in undirected graphs and the directed Steiner network problem. Zbl 1295.68211
Chekuri, Chandra; Even, Guy; Gupta, Anupam; Segev, Danny |
|
2011
|
Approximation algorithms for submodular multiway partition. Zbl 1292.68163
Chekuri, Chandra; Ene, Alina |
|
2011
|
Prize-collecting Steiner problems on planar graphs. Zbl 1376.68059
Bateni, M.; Chekuri, C.; Ene, A.; Hajiaghayi, M. T.; Korula, N.; Marx, D. |
|
2011
|
Submodular cost allocation problem and applications. Zbl 1333.90092
Chekuri, Chandra; Ene, Alina |
|
2011
|
Approximability of capacitated network design. Zbl 1339.90321
Chakrabarty, Deeparnab; Chekuri, Chandra; Khanna, Sanjeev; Korula, Nitish |
|
2011
|
Buy-at-bulk network design with protection. Zbl 1216.68336
Antonakopoulos, Spyridon; Chekuri, Chandra; Shepherd, Bruce; Zhang, Lisa |
|
2011
|
New models and algorithms for throughput maximization in broadcast scheduling (extended abstract). Zbl 1314.68406
Chekuri, Chandra; Gal, Avigdor; Im, Sungjin; Khuller, Samir; Li, Jian; McCutchen, Richard; Moseley, Benjamin; Raschid, Louiqa |
|
2011
|
Approximation algorithms for nonuniform buy-at-bulk network design. Zbl 1207.90019
Chekuri, C.; Hajiaghayi, M. T.; Kortsarz, G.; Salavatipour, M. R. |
|
2010
|
Flow-cut gaps for integer and fractional multiflows. Zbl 1288.05119
Chekuri, Chandra; Shepherd, F. Bruce; Weibel, Christophe |
|
2010
|
Longest wait first for broadcast scheduling (extended abstract). Zbl 1284.68678
Chekuri, Chandra; Im, Sungjin; Moseley, Benjamin |
|
2010
|
A graph reduction step preserving element-connectivity and applications. Zbl 1247.05236
Chekuri, Chandra; Korula, Nitish |
|
2009
|
Unsplittable flow in paths and trees and column-restricted packing integer programs. Zbl 1254.68353
Chekuri, Chandra; Ene, Alina; Korula, Nitish |
|
2009
|
Edge-disjoint paths in planar graphs with constant congestion. Zbl 1185.68848
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2009
|
Truthful mechanisms via greedy iterative packing. Zbl 1254.68354
Chekuri, Chandra; Gamzu, Iftah |
|
2009
|
A note on multiflows and treewidth. Zbl 1176.90600
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2009
|
On the set multi-cover problem in geometric settings. Zbl 1388.68286
Chekuri, Chandra; Clarkson, Kenneth L.; Har-Peled, Sariel |
|
2009
|
Minimizing maximum response time and delay factor in broadcast scheduling. Zbl 1256.68018
Chekuri, Chandra; Im, Sungjin; Moseley, Benjamin |
|
2009
|
Disjoint bases in a polymatroid. Zbl 1205.05039
Călinescu, Gruia; Chekuri, Chandra; Vondrák, Jan |
|
2009
|
Online scheduling to minimize the maximum delay factor. Zbl 1423.90083
Chekuri, Chandra; Moseley, Benjamin |
|
2009
|
Improved algorithms for orienteering and related problems. Zbl 1192.90162
Chekuri, Chandra; Korula, Nitish; Pál, Martin |
|
2008
|
Single-sink network design with vertex connectivity requirements. Zbl 1248.68059
Chekuri, Chandra; Korula, Nitish |
|
2008
|
Set connectivity problems in undirected graphs and the directed Steiner network problem. Zbl 1192.68030
Chekuri, Chandra; Even, Guy; Gupta, Anupam; Segev, Danny |
|
2008
|
Algorithms for 2-route cut problems. Zbl 1153.68566
Chekuri, Chandra; Khanna, Sanjeev |
|
2008
|
Pruning 2-connected graphs. Zbl 1248.68579
Chekuri, Chandra; Korula, Nitish |
|
2008
|
Approximate integer decompositions for undirected network design problems. Zbl 1185.68849
Chekuri, Chandra; Shepherd, F. Bruce |
|
2008
|
Maximizing a submodular set function subject to a matroid constraint (extended abstract). Zbl 1136.90449
Calinescu, Gruia; Chekuri, Chandra; Pál, Martin; Vondrák, Jan |
|
2007
|
Multicommodity demand flow in a tree and packing integer programs. Zbl 1192.68879
Chekuri, Chandra; Mydlarz, Marcelo; Shepherd, F. Bruce |
|
2007
|
Hardness of robust network design. Zbl 1119.90005
Chekuri, C.; Shepherd, F. B.; Oriolo, G.; Scutellá, M. G. |
|
2007
|
Approximation algorithms for the unsplittable flow problem. Zbl 1107.68120
Chakrabarti, Amit; Chekuri, Chandra; Gupta, Anupam; Kumar, Amit |
|
2007
|
Approximation algorithms for node-weighted buy-at-bulk network design. Zbl 1302.90028
Chekuri, C.; Hajiaghayi, M. T.; Kortsarz, G.; Salavatipour, M. R. |
|
2007
|
An \(O(\log n)\) approximation ratio for the asymmetric traveling salesman path problem. Zbl 1213.68701
Chekuri, Chandra; Pál, Martin |
|
2007
|
A polynomial time approximation scheme for the multiple knapsack problem. Zbl 1095.68035
Chekuri, Chandra; Khanna, Sanjeev |
|
2006
|
An \(O(\sqrt{n})\) approximation and integrality gap for disjoint paths and unsplittable flow. Zbl 1213.68700
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2006
|
Embedding \(k\)-outerplanar graphs into \(\ell_1\). Zbl 1111.05022
Chekuri, Chandra; Gupta, Anupam; Newman, Ilan; Rabinovich, Yuri; Sinclair, Alistair |
|
2006
|
A greedy approximation algorithm for the group Steiner problem. Zbl 1083.68089
Chekuri, Chandra; Even, Guy; Kortsarz, Guy |
|
2006
|
Edge-disjoint paths in planar graphs with constant congestion. Zbl 1301.68268
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2006
|
The Steiner \(k\)-cut problem. Zbl 1107.68121
Chekuri, Chandra; Guha, Sudipto; Naor, Joseph |
|
2006
|
An \(O(\log n)\) approximation ratio for the asymmetric traveling salesman path problem. Zbl 1155.90465
Chekuri, Chandra; Pál, Martin |
|
2006
|
Multicommodity flow, well-linked terminals, and routing problems. Zbl 1192.90017
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce |
|
2005
|
A linear programming formulation and approximation algorithms for the metric labeling problem. Zbl 1077.68036
Chekuri, C.; Khanna, S.; Naor, J.; Zosin, L. |
|
2005
|
Sampling bounds for stochastic optimization. Zbl 1142.90459
Charikar, Moses; Chekuri, Chandra; Pál, Martin |
|
2005
|
Building edge-failure resilient networks. Zbl 1086.68021
Chekuri, Chandra; Gupta, A.; Kumar, Amit; Naor, J.; Raz, Danny |
|
2005
|
On a bidirected relaxation for the MULTIWAY CUT problem. Zbl 1080.90078
Chekuri, Chandra; Gupta, Anupam; Kumar, Amit |
|
2005
|
Incremental clustering and dynamic information retrieval. Zbl 1101.68605
Charikar, Moses; Chekuri, Chandra; Feder, Tomas; Motwani, Rajeev |
|
2004
|
Maximum coverage problem with group budget constraints and applications. Zbl 1106.90062
Chekuri, Chandra; Kumar, Amit |
|
2004
|
On multidimensional packing problems. Zbl 1101.68606
Chekuri, Chandra; Khanna, Sanjeev |
|
2004
|
Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation. Zbl 1192.68096
Chekuri, Chandra; Goel, Ashish; Khanna, Sanjeev; Kumar, Amit |
|
2004
|
...and 29 more Documents |