Complexity and approximability of k-splittable flows

DOI10.1016/J.TCS.2006.09.015MaRDI QIDQ861276zbMATH OpenOpenAlexFDO

Authors Ronald Koch, Ines Spenke

Publication date 9 January 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.09.015

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Approximation and Online Algorithms
• Maximum \(k\)-splittable \(s, t\)-flows
• The \(k\)-splittable flow problem
• scientific article; zbMATH DE number 1947385
• A polynomial time approximation algorithm for the two-commodity splittable flow problem

Cites work

• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Algorithms – ESA 2004
• Approximation and Online Algorithms
• Mathematical Foundations of Computer Science 2003
• Network flows. Theory, algorithms, and applications.
• The \(k\)-splittable flow problem

Cited in

(6)

• The \(k\)-splittable flow problem
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
• An adaptive routing approach for personal rapid transit
• Approximation and Online Algorithms
• Maximum \(k\)-splittable \(s, t\)-flows

This page was built for publication: Complexity and approximability of \(k\)-splittable flows

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