Minimum-Cost Single-Source 2-Splittable Flow

Citations of this article
Mendeley users who have this article in their library.
Get full text


In the single-source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain sinks in a given graph with edge capacities and costs. The demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover the cost of the solution should not exceed a given budget. An important open question is whether a simultaneous (2,1)-approximation can be achieved for minimizing congestion and cost, i.e., the budget constraint should not be violated. In this note we show that this is possible for the case of 2-splittable flows, i.e., flows where the demand of each commodity is routed along at most two paths. © 2004 Elsevier B.V. All rights reserved.




Kolliopoulos, S. G. (2004). Minimum-Cost Single-Source 2-Splittable Flow. Electronic Notes in Discrete Mathematics, 17, 197–201.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free