Constrained flows in networks
- 21 June 2024
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1010
Abstract
No abstract availableKeywords
Funding Information
- Danmarks Frie Forskningsfond (DFF 7014-00037B, DIGRAPHS ANR-19-CE48-0013, ANR-17-EURE-0004)
This publication has 12 references indexed in Scilit:
- FPT algorithms for packing -safe spanning rooted sub(di)graphsDiscrete Applied Mathematics, 2023
- The complexity of computing a robust flowOperations Research Letters, 2020
- The complexity of finding arc-disjoint branching flowsDiscrete Applied Mathematics, 2016
- Balanced branchings in digraphsTheoretical Computer Science, 2015
- (Arc-)disjoint flows in networksTheoretical Computer Science, 2014
- Arc-disjoint spanning sub(di)graphs in digraphsTheoretical Computer Science, 2012
- The k-Splittable Flow ProblemAlgorithmica, 2005
- Approximating the single source unsplittable min-cost flow problemMathematical Programming, 2002
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976