| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142967 | Operations Research Letters | 2009 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Fernanda Salazar, Martin Skutella,