Single-source k-splittable min-cost flows

Authors:
Fernanda Salazar;Martin Skutella
Affiliations:
Escuela Politécnica Nacional, Departamento de Matemática, Quito, Ecuador;TU Berlin, Institut für Mathematik, MA 5-2, Str. des 17. Juni 136, 10623 Berlin, Germany
Venue:
Operations Research Letters
Year:
2009

Citing 6
Cited 1

Approximation Algorithms for Single-Source Unsplittable Flow

SIAM Journal on Computing
Single-source unsplittable flow

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems

Approximation algorithms for disjoint paths problems
NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow

Journal of Scheduling
Minimum-cost single-source 2-splittable flow

Information Processing Letters
Convex combinations of single source unsplittable flows

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Maximum flows on disjoint paths

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Quantified Score

Hi-index	0.00

Visualization

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.