The following publications are possibly variants of this publication:
- Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary DemandsAnya Chaturvedi, Chandra Chekuri, Mengxue Liu, Andréa W. Richa, Matthias Rost, Stefan Schmid 0001, Jamison Weber. ton, 32(2):1435-1450, April 2024. [doi]
- The All-or-Nothing Multicommodity Flow ProblemChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. SICOMP, 42(4):1467-1493, 2013. [doi]
- The all-or-nothing multicommodity flow problemChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd. stoc 2004: 156-165 [doi]
- Multicommodity Demand Flow in a TreeChandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd. icalp 2003: 410-425 [doi]
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar GraphsKen-ichi Kawarabayashi, Yusuke Kobayashi 0001. SICOMP, 47(4):1483-1504, 2018. [doi]
- The all-or-nothing flow problem in directed graphs with symmetric demand pairsChandra Chekuri, Alina Ene. mp, 154(1-2):249-272, 2015. [doi]
- The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand PairsChandra Chekuri, Alina Ene. ipco 2014: 222-233 [doi]
- Multicommodity Flows in Planar Graphs with Demands on FacesNikhil Kumar 0001. isaac 2020: [doi]
- Multicommodity demand flow in a tree and packing integer programsChandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd. TALG, 3(3):27, 2007. [doi]