On the approximation of the single source \(k\)-splittable flow problem

DOI10.1016/j.jda.2007.03.001zbMath1153.90335OpenAlexW1991111061MaRDI QIDQ935843

Antonino Sgalambro, Massimiliano Caramia

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

throughput\(k\)-splittable flowmulticommoditysingle-sourceunsplittable

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (4)

A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Service network design models for two-tier city logistics ⋮ An exact approach for the maximum concurrent \(k\)-splittable flow problem

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• The \(k\)-splittable flow problem
• Minimum-cost single-source 2-splittable flow
• On the single-source unsplittable flow problem
• Approximating the single source unsplittable min-cost flow problem
• Hardness of the undirected congestion minimization problem
• Algorithms – ESA 2004
• Approximation and Online Algorithms
• New hardness results for congestion minimization and machine scheduling

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