Single-source k-splittable min-cost flows

Single-source k-splittable min-cost flows

0.00 Avg rating0 Votes
Article ID: iaor20102943
Volume: 37
Issue: 2
Start Page Number: 71
End Page Number: 74
Publication Date: Mar 2009
Journal: Operations Research Letters
Authors: ,
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.

Reviews

Required fields are marked *. Your email address will not be published.