On the approximation of the single source k-splittable flow problem

DOI10.1016/J.JDA.2007.03.001MaRDI QIDQ935843zbMATH OpenOpenAlexFDO

Authors Massimiliano Caramia, Antonino Sgalambro

Publication date 8 August 2008

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2007.03.001

zbMATH Keywords

\(k\)-splittable flowmulticommoditysingle-sourcethroughputunsplittable

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Single-source \(k\)-splittable min-cost flows
• The \(k\)-splittable flow problem
• scientific article; zbMATH DE number 1947385
• Implementing approximation algorithms for the single-source unsplittable flow problem
• Minimum-Cost Single-Source 2-Splittable Flow

Cites work

• Algorithms – ESA 2004
• Approximating the single source unsplittable min-cost flow problem
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation and Online Algorithms
• Hardness of the undirected congestion minimization problem
• scientific article; zbMATH DE number 1342140 (Why is no real title available?)
• Minimum-cost single-source 2-splittable flow
• New hardness results for congestion minimization and machine scheduling
• On the single-source unsplittable flow problem
• The \(k\)-splittable flow problem

Cited in

(11)

• Single-source \(k\)-splittable min-cost flows
• On the single-source unsplittable flow problem
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• Service network design models for two-tier city logistics
• Minimum-Cost Single-Source 2-Splittable Flow
• Implementing approximation algorithms for the single-source unsplittable flow problem
• Convex Combinations of Single Source Unsplittable Flows
• scientific article; zbMATH DE number 1342140 (Why is no real title available?)
• The \(k\)-splittable flow problem
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
• An exact approach for the maximum concurrent \(k\)-splittable flow problem

This page was built for publication: On the approximation of the single source \(k\)-splittable flow problem

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