Salazar, FernandaSkutella, Martin2021-12-172021-12-1720092197-8085https://depositonce.tu-berlin.de/handle/11303/15676http://dx.doi.org/10.14279/depositonce-14449Motivated 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.en510 Mathematikapproximation algorithmmulti-commodity flownetwork flowroutingunsplittable flowk-splittable flowResearch Paper