Single source unsplittable flows with arc-wise lower and upper bounds
From MaRDI portal
Publication:2118142
DOI10.1007/S10107-021-01704-4zbMATH Open1489.90160OpenAlexW4245766490MaRDI QIDQ2118142FDOQ2118142
Authors: 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
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Handbook of Approximation Algorithms and Metaheuristics
- On the single-source unsplittable flow problem
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Single-source \(k\)-splittable min-cost flows
- Minimum-cost single-source 2-splittable flow
- The \(k\)-splittable flow problem
- Minimizing flow-time on unrelated machines
- Maximum \(k\)-splittable \(s, t\)-flows
- Approximating the single source unsplittable min-cost flow problem
- Approximation algorithms for single-source unsplittable flow
- Implementing approximation algorithms for the single-source unsplittable flow problem
- Convex Combinations of Single Source Unsplittable Flows
- Network flow algorithms
Cited In (2)
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)
