default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChandra Chekuri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j64]Chandra Chekuri, Vasilis Livanos
:
On submodular prophet inequalities and correlation gap. Theor. Comput. Sci. 1019: 114814 (2024)- [j63]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): 1435-1450 (2024) - [c121]Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. AAAI 2024: 9590-9597 - [c120]Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, Weihao Zhu:
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. APPROX/RANDOM 2024: 9:1-9:21 - [c119]Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing. ESA 2024: 41:1-41:21 - [c118]Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu:
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. ESA 2024: 42:1-42:19 - [c117]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: 3062-3088 - [c116]Chandra Chekuri, Junkai Song, Weizhong Zhang:
Contention Resolution for the ℓ-fold union of a matroid via the correlation gap. SOSA 2024: 396-405 - [i60]Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Network Design in Non-Uniform Fault Models. CoRR abs/2403.15547 (2024) - [i59]Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing. CoRR abs/2404.16725 (2024) - [i58]Chandra Chekuri, Junkai Song:
Colorful Priority k-Supplier. CoRR abs/2406.14984 (2024) - [i57]Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu:
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. CoRR abs/2407.01904 (2024) - 2023
- [j62]Karthekeyan Chandrasekaran, Chandra Chekuri:
Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. Comb. 43(3): 455-477 (2023) - [c115]Tanvi Bajpai, Chandra Chekuri:
Bicriteria Approximation Algorithms for Priority Matroid Median. APPROX/RANDOM 2023: 7:1-7:22 - [c114]Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. APPROX/RANDOM 2023: 24:1-24:22 - [c113]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: 56:1-56:17 - [c112]Chandra Chekuri, Rhea Jain:
Approximation Algorithms for Network Design in Non-Uniform Fault Models. ICALP 2023: 36:1-36:20 - [i56]Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge:
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR abs/2303.12850 (2023) - [i55]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. CoRR abs/2305.02987 (2023) - [i54]Chandra Chekuri, Manuel R. Torres:
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. CoRR abs/2306.02172 (2023) - [i53]Chandra Chekuri, Kent Quanrud:
Independent Sets in Elimination Graphs with a Submodular Objective. CoRR abs/2307.02022 (2023) - [i52]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 abs/2307.03307 (2023) - [i51]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 abs/2310.18146 (2023) - [i50]Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta:
1/2 Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. CoRR abs/2312.08504 (2023) - 2022
- [j61]Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, Zhao Zhang:
Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim. 44(2): 979-1010 (2022) - [j60]Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time. Math. Oper. Res. 47(4): 3380-3399 (2022) - [j59]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): 22-27 (2022) - [j58]Chandra Chekuri, Tanmay Inamdar:
Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory Comput. 18: 1-19 (2022) - [c111]Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu:
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS 2022: 6:1-6:18 - [c110]Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Faster and Scalable Algorithms for Densest Subgraph and Decomposition. NeurIPS 2022 - [c109]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. SODA 2022: 1531-1555 - [i49]Chandra Chekuri, Rhea Jain:
Augmentation based Approximation Algorithms for Flexible Network Design. CoRR abs/2209.12273 (2022) - [i48]Tanvi Bajpai, Chandra Chekuri:
Bicriteria Approximation Algorithms for Priority Matroid Median. CoRR abs/2210.01888 (2022) - [i47]Chandra Chekuri, Kent Quanrud:
(1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time. CoRR abs/2210.02611 (2022) - [i46]Chandra Chekuri, Rhea Jain:
Approximating Flexible Graph Connectivity via Räcke Tree based Rounding. CoRR abs/2211.08324 (2022) - 2021
- [j57]Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-weighted Network Design in Planar and Minor-closed Families of Graphs. ACM Trans. Algorithms 17(2): 14:1-14:25 (2021) - [c108]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. APPROX-RANDOM 2021: 24:1-24:21 - [c107]Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani:
Revisiting Priority k-Center: Fairness and Outliers. ICALP 2021: 21:1-21:20 - [c106]Chandra Chekuri, Kent Quanrud:
Faster Algorithms for Rooted Connectivity in Directed Graphs. ICALP 2021: 49:1-49:16 - [c105]Chandra Chekuri, Kent Quanrud:
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. ICALP 2021: 50:1-50:20 - [c104]Chandra Chekuri, Vasilis Livanos:
On Submodular Prophet Inequalities and Correlation Gap. SAGT 2021: 410 - [c103]Karthekeyan Chandrasekaran, Chandra Chekuri:
Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. SODA 2021: 1026-1038 - [e3]Mikolaj Bojanczyk, Chandra Chekuri:
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. LIPIcs 213, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-215-0 [contents] - [i45]Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani:
Revisiting Priority k-Center: Fairness and Outliers. CoRR abs/2103.03337 (2021) - [i44]Chandra Chekuri, Kent Quanrud:
Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems. CoRR abs/2103.12908 (2021) - [i43]Chandra Chekuri, Kent Quanrud:
Faster Algorithms for Rooted Connectivity in Directed Graphs. CoRR abs/2104.07205 (2021) - [i42]Chandra Chekuri, Vasilis Livanos:
On Submodular Prophet Inequalities and Correlation Gap. CoRR abs/2107.03662 (2021) - 2020
- [j56]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
ℓ 1-Sparsity approximation bounds for packing integer programs. Math. Program. 183(1): 195-214 (2020) - [j55]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-Cut. SIAM J. Discret. Math. 34(2): 1334-1353 (2020) - [j54]Chandra Chekuri, Shi Li:
On the Hardness of Approximating the k-Way Hypergraph Cut problem. Theory Comput. 16: 1-8 (2020) - [c102]Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. FOCS 2020: 810-821 - [c101]Chandra Chekuri, Sariel Har-Peled, Kent Quanrud:
Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA 2020: 1019-1038 - [i41]Karthekeyan Chandrasekaran, Chandra Chekuri:
Hypergraph k-cut for fixed k in deterministic polynomial time. CoRR abs/2009.12442 (2020) - [i40]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. CoRR abs/2011.03194 (2020)
2010 – 2019
- 2019
- [c100]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
\ell _1 -sparsity Approximation Bounds for Packing Integer Programs. IPCO 2019: 128-140 - [c99]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-cuts. SOSA 2019: 7:1-7:18 - [c98]Chandra Chekuri, Kent Quanrud:
Submodular Function Maximization in Parallel via the Multilinear Relaxation. SODA 2019: 303-322 - [c97]Chandra Chekuri, Kent Quanrud:
On Approximating (Sparse) Covering Integer Programs. SODA 2019: 1596-1615 - [c96]Chandra Chekuri, Kent Quanrud:
Parallelizing greedy for submodular set function maximization in matroids and beyond. STOC 2019: 78-89 - [i39]Chandra Chekuri, Kent Quanrud, Manuel R. Torres:
$\ell_1$-sparsity Approximation Bounds for Packing Integer Programs. CoRR abs/1902.08698 (2019) - [i38]Chandra Chekuri, Kent Quanrud, Zhao Zhang:
On Approximating Partial Set Cover and Generalizations. CoRR abs/1907.04413 (2019) - [i37]Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. CoRR abs/1910.07616 (2019) - [i36]Chandra Chekuri, Tanmay Inamdar:
Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks. CoRR abs/1911.01374 (2019) - 2018
- [j53]Chandra Chekuri, Anastasios Sidiropoulos:
Approximation Algorithms for Euler Genus and Related Problems. SIAM J. Comput. 47(4): 1610-1643 (2018) - [j52]Chandra Chekuri, Chao Xu:
Minimum Cuts and Sparsification in Hypergraphs. SIAM J. Comput. 47(6): 2118-2156 (2018) - [j51]Chandra Chekuri, Alina Ene, Marcin Pilipczuk:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. SIAM J. Discret. Math. 32(3): 2134-2160 (2018) - [c95]Chandra Chekuri, Shalmoli Gupta:
Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations. APPROX-RANDOM 2018: 9:1-9:16 - [c94]Chandra Chekuri, Thapanapong Rukkanchanunt:
A Note on Iterated Rounding for the Survivable Network Design Problem. SOSA 2018: 2:1-2:10 - [c93]Chandra Chekuri, Mark Idleman:
Congestion Minimization for Multipath Routing via Multiroute Flows. SOSA 2018: 3:1-3:12 - [c92]Chandra Chekuri, Kent Quanrud:
Randomized MWU for Positive LPs. SODA 2018: 358-377 - [i35]Chandra Chekuri, Kent Quanrud:
Fast Approximations for Metric-TSP via Linear Programming. CoRR abs/1802.01242 (2018) - [i34]Chandra Chekuri, Shalmoli Gupta:
Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations. CoRR abs/1806.04202 (2018) - [i33]Chandra Chekuri, Kent Quanrud:
Submodular Function Maximization in Parallel via the Multilinear Relaxation. CoRR abs/1807.08678 (2018) - [i32]Chandra Chekuri, Kent Quanrud:
On Approximating (Sparse) Covering Integer Programs. CoRR abs/1807.11538 (2018) - [i31]Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-cuts. CoRR abs/1808.05765 (2018) - [i30]Chandra Chekuri, Kent Quanrud:
Parallelizing greedy for submodular set function maximization in matroids and beyond. CoRR abs/1811.12568 (2018) - 2017
- [c91]Chandra Chekuri, Kent Quanrud:
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. FOCS 2017: 789-800 - [c90]Chandra Chekuri, Kent Quanrud:
Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. SODA 2017: 801-820 - [c89]Chandra Chekuri, Vivek Madan:
Approximating Multicut and the Demand Graph. SODA 2017: 855-874 - [c88]Chandra Chekuri, Chao Xu:
Computing minimum cuts in hypergraphs. SODA 2017: 1085-1100 - [i29]Chandra Chekuri, Kent Quanrud:
Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. CoRR abs/1702.04307 (2017) - [i28]Chandra Chekuri, Chao Xu:
A note on approximate strengths of edges in a hypergraph. CoRR abs/1703.03849 (2017) - 2016
- [j50]Chandra Chekuri, Julia Chuzhoy:
Polynomial Bounds for the Grid-Minor Theorem. J. ACM 63(5): 40:1-40:65 (2016) - [c87]Chandra Chekuri, Alina Ene, Marcin Pilipczuk:
Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. ICALP 2016: 7:1-7:14 - [c86]Chandra Chekuri, Kent Quanrud:
A Fast Approximation for Maximum Weight Matroid Intersection. SODA 2016: 445-457 - [c85]Chandra Chekuri, Vivek Madan:
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. SODA 2016: 797-807 - [c84]Chandra Chekuri, Vivek Madan:
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation. SODA 2016: 808-820 - [r4]Michael Langberg, Chandra Chekuri:
Graph Coloring. Encyclopedia of Algorithms 2016: 869-872 - [r3]Chandra Chekuri:
Multicommodity Flow, Well-linked Terminals and Routing Problems. Encyclopedia of Algorithms 2016: 1359-1363 - [i27]Chandra Chekuri, Vivek Madan:
Approximating Multicut and the Demand Graph. CoRR abs/1607.07200 (2016) - [i26]Chandra Chekuri, Chao Xu:
Computing minimum cuts in hypergraphs. CoRR abs/1607.08682 (2016) - [i25]Chandra Chekuri, Thapanapong Rukkanchanunt:
A note on the Survivable Network Design Problem. CoRR abs/1608.02515 (2016) - 2015
- [j49]Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
Approximability of Capacitated Network Design. Algorithmica 72(2): 493-514 (2015) - [j48]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): 29-53 (2015) - [j47]Chandra Chekuri, Alina Ene:
The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program. 154(1-2): 249-272 (2015) - [j46]Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity Flows and Cuts in Polymatroidal Networks. SIAM J. Comput. 44(4): 912-943 (2015) - [c83]Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu:
On Element-Connectivity Preserving Graph Simplification. ESA 2015: 313-324 - [c82]Chandra Chekuri, Shalmoli Gupta, Kent Quanrud:
Streaming Algorithms for Submodular Function Maximization. ICALP (1) 2015: 318-330 - [c81]Chandra Chekuri, T. S. Jayram, Jan Vondrák:
On Multiplicative Weight Updates for Concave and Submodular Function Maximization. ITCS 2015: 201-210 - [c80]Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Delay-constrained unicast and the triangle-cast problem. ISIT 2015: 804-808 - [c79]Chandra Chekuri, Julia Chuzhoy:
Degree-3 Treewidth Sparsifiers. SODA 2015: 242-255 - [i24]Chandra Chekuri, Shalmoli Gupta, Kent Quanrud:
Streaming Algorithms for Submodular Function Maximization. CoRR abs/1504.08024 (2015) - [i23]Chandra Chekuri, Vivek Madan:
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. CoRR abs/1507.04674 (2015) - 2014
- [j45]Chandra Chekuri, Jan Vondrák, Rico Zenklusen:
Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. SIAM J. Comput. 43(6): 1831-1879 (2014) - [j44]Chandra Chekuri, Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests. SIAM J. Discret. Math. 28(2): 577-597 (2014) - [c78]Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of Trees for Capacitated k-Center. IPCO 2014: 52-63 - [c77]Chandra Chekuri, Alina Ene:
The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. IPCO 2014: 222-233 - [c76]Chandra Chekuri, Julia Chuzhoy:
Polynomial bounds for the grid-minor theorem. STOC 2014: 60-69 - [e2]Chandra Chekuri:
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. SIAM 2014, ISBN 978-1-61197-338-9 [contents] - [i22]Chandra Chekuri, Julia Chuzhoy:
Degree-3 Treewidth Sparsifiers. CoRR abs/1410.1016 (2014) - 2013
- [j43]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-cut gaps for integer and fractional multiflows. J. Comb. Theory B 103(2): 248-273 (2013) - [j42]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
The All-or-Nothing Multicommodity Flow Problem. SIAM J. Comput. 42(4): 1467-1493 (2013) - [c75]Chandra Chekuri, Anastasios Sidiropoulos:
Approximation Algorithms for Euler Genus and Related Problems. FOCS 2013: 167-176 - [c74]Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd:
Maximum Edge-Disjoint Paths in k-Sums of Graphs. ICALP (1) 2013: 328-339 - [c73]Chandra Chekuri, Alina Ene:
Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion. SODA 2013: 326-341 - [c72]Chandra Chekuri, Julia Chuzhoy:
Large-treewidth graph decompositions and applications. STOC 2013: 291-300 - [i21]Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd:
Maximum Edge-Disjoint Paths in $k$-sums of Graphs. CoRR abs/1303.4897 (2013) - [i20]Chandra Chekuri, Julia Chuzhoy:
Large-Treewidth Graph Decompositions and Applications. CoRR abs/1304.1577 (2013) - [i19]Chandra Chekuri, Anastasios Sidiropoulos:
Approximation algorithms for Euler genus and related problems. CoRR abs/1304.2416 (2013) - [i18]Chandra Chekuri, Julia Chuzhoy:
Polynomial Bounds for the Grid-Minor Theorem. CoRR abs/1305.6577 (2013) - 2012
- [j41]Chandra Chekuri, Nitish Korula:
Pruning 2-Connected Graphs. Algorithmica 62(1-2): 436-463 (2012) - [j40]Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. ACM Trans. Algorithms 8(3): 23:1-23:27 (2012) - [j39]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the set multicover problem in geometric settings. ACM Trans. Algorithms 9(1): 9:1-9:17 (2012) - [j38]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor. Theory Comput. 8(1): 165-195 (2012) - [c71]Chandra Chekuri, Alina Ene, Ali Vakilian:
Prize-Collecting Survivable Network Design in Node-Weighted Graphs. APPROX-RANDOM 2012: 98-109 - [c70]Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. ICALP (1) 2012: 206-217 - [c69]Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Multicommodity flows and cuts in polymatroidal networks. ITCS 2012: 399-408 - 2011
- [j37]