Single source unsplittable flows with arc-wise lower and upper bounds

DOI10.1007/s10107-021-01704-4zbMath1489.90160OpenAlexW4245766490MaRDI QIDQ2118142

Sarah Morell, Martin Skutella

Publication date: 22 March 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-021-01704-4

zbMATH Keywords

network flowroundingunsplittable flowflow augmentation

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• The \(k\)-splittable flow problem
• Maximum \(k\)-splittable \(s, t\)-flows
• Single-source \(k\)-splittable min-cost flows
• Minimum-cost single-source 2-splittable flow
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• On the single-source unsplittable flow problem
• Approximating the single source unsplittable min-cost flow problem
• Approximation Algorithms for Single-Source Unsplittable Flow
• Minimizing Flow-Time on Unrelated Machines
• Handbook of Approximation Algorithms and Metaheuristics
• Implementing approximation algorithms for the single-source unsplittable flow problem
• Convex Combinations of Single Source Unsplittable Flows
• Network Flow Algorithms