Flows with unit path capacities and related packing and covering problems

Flows with unit path capacities and related packing and covering problems

0.00 Avg rating0 Votes
Article ID: iaor200971817
Country: Netherlands
Volume: 18
Issue: 3
Start Page Number: 272
End Page Number: 293
Publication Date: Oct 2009
Journal: Journal of Combinatorial Optimization
Authors: ,
Abstract:

Since the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one of the most important and most active areas of research in combinatorial optimization. Coming from the classical maximum flow problem, we introduce and study an apparently basic but new flow problem that features a couple of interesting peculiarities. We derive several results on the complexity and approximability of the new problem. On the way we also discover two closely related basic covering and packing problems that are of independent interest. Starting from an LP formulation of the maximum s-t-flow problem in path variables, we introduce unit upper bounds on the amount of flow being sent along each path. The resulting (fractional) flow problem is NP-hard; its integral version is strongly NP-hard already on very simple classes of graphs. For the fractional problem we present a fully polynomial-time approximation scheme (FPTAS) that is based on solving the k shortest paths problem iteratively. We show that the integral problem is hard to approximate and give an interesting O(log m)-approximation algorithm, where m is the number of arcs in the considered graph. For the multicommodity version of the problem there is an Om-approximation algorithm. We argue that this performance guarantee is best possible, unless P=NP.

Reviews

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