Complexity and approximability of \(k\)-splittable flows

DOI10.1016/j.tcs.2006.09.015zbMath1110.68106OpenAlexW2050570968MaRDI QIDQ861276

Ines Spenke, Ronald Koch

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

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

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• The \(k\)-splittable flow problem
• Mathematical Foundations of Computer Science 2003
• Algorithms – ESA 2004
• Approximation and Online Algorithms

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