Complexity and approximability of k-splittable flows

@article{Koch2006ComplexityAA,
  title={Complexity and approximability of k-splittable flows},
  author={Ronald Koch and Ines Spenke},
  journal={Theor. Comput. Sci.},
  year={2006},
  volume={369},
  pages={338-347}
}
Let G = (V, E) be a graph with a source node s and a sink node t, |V | = n, |E| = m. For a given number k, the Maximum k–Splittable Flow Problem (MkSF) is to find an s, t–flow of maximum value with a flow decomposition using at most k paths. In the multicommodity case this problem generalizes disjoint paths problems and unsplittable flow problems. We provide a comprehensive overview of the complexity and approximability landscape of MkSF on directed and undirected graphs. We consider constant… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
10 Extracted Citations
11 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 11 references

Flows in Networks

  • L. R. Ford, D. R. Fulkerson
  • 1962
Highly Influential
3 Excerpts

Flows with Path Restrictions

  • G. Baier
  • PhD thesis, TU Berlin,
  • 2003
1 Excerpt

On the ksplittable flow problem

  • E. Köhler, M. Skutella
  • Flows with Path Restrictions . PhD thesis
  • 2003

Skutella . Flows on few paths : Algorithms and lower bounds

  • M.
  • 2003

Similar Papers

Loading similar papers…