@techreport{Report-002-2009,
Title = {Single-source $k$-splittable min-cost flows},
Author = {Fernanda Salazar and Martin Skutella},
Year = {2009},
Number = {002},
Note = {Operations Research Letters, 2009, to appear.},
Type = {Preprint},
Institution = {Technische Universit\"at Berlin, Institut f\"ur 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.},
Url = {http://www.redaktion.tu-berlin.de/fileadmin/i26/download/AG_DiskAlg/FG_KombOptGraphAlg/preprints/2009/Report-002-2009.pdf},
Keywords = {Approximation Algorithm; Multi-Commodity Flow; Network Flow; Routing; Unsplittable Flow; $k$-Splittable Flow}
}