Single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds

DOI10.1007/978-3-030-45771-6_23zbMath1503.90151OpenAlexW3015482505MaRDI QIDQ5041753

Martin Skutella, Sarah Morell

Publication date: 14 October 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_23

zbMATH Keywords

existence of an unsplittable flow, upper and lower bounds

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Bifactor approximation for location routing with vehicle and facility capacities

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
• 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