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

DOI10.1007/S10107-021-01704-4MaRDI QIDQ2118142zbMATH OpenOpenAlexFDO

Authors Sarah Morell, Martin Skutella

Publication date 22 March 2022

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Single source unsplittable flows with arc-wise lower and upper bounds
• On the single-source unsplittable flow problem
• Minimum-cost single-source 2-splittable flow
• Convex Combinations of Single Source Unsplittable Flows
• Flows on few paths: Algorithms and lower bounds

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Approximating the single source unsplittable min-cost flow problem
• Approximation algorithms for single-source unsplittable flow
• Convex Combinations of Single Source Unsplittable Flows
• Handbook of Approximation Algorithms and Metaheuristics
• Implementing approximation algorithms for the single-source unsplittable flow problem
• Maximum \(k\)-splittable \(s, t\)-flows
• Minimizing flow-time on unrelated machines
• Minimum-cost single-source 2-splittable flow
• Network flow algorithms
• Network flows. Theory, algorithms, and applications.
• On the single-source unsplittable flow problem
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Single-source \(k\)-splittable min-cost flows
• The \(k\)-splittable flow problem

Cited in

(2)

• Convex Combinations of Single Source Unsplittable Flows
• Single source unsplittable flows with arc-wise lower and upper bounds

This page was built for publication: Single source unsplittable flows with arc-wise lower and upper bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118142)