TU Berlin

Combinatorial Optimization & Graph Algorithms group (COGA)2009

COGA 5-Wheel

Page Content

to Navigation

Preprints 2009

Single-source $k$-splittable min-cost flows
Citation key Report-002-2009
Author Fernanda Salazar and Martin Skutella
Year 2009
Number 002
Note Operations Research Letters, 2009, to appear.
Institution Technische Universität Berlin, Institut für Mathematik
Abstract Motivated by a famous open question on the single-source unsplittable minimum cost flow problem, we present a new approximation result for the relaxation of the problem where, for a given number $k$, each commodity must be routed along at most $k$ paths.
Bibtex Type of Publication Preprint
Link to publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe