On the Single-Source Unsplittable Flow Problem |
| |
Authors: | Yefim Dinitz Naveen Garg Michel X Goemans |
| |
Institution: | (1) Department of Computer Science, Ben-Gurion University of the Negev; Beer-Sheva, Israel; E-mail: dinitz@cs.bgu.ac.il, IL;(2) Department of Computer Science and Engineering, Indian Institute of Technology; New Delhi; E-mail: naveen@cse.iitd.ernet.in, IN;(3) CORE; 34 Voie du Roman Pays, B-1348 Louvain-La-Neuve, Belgium; E-mail: goemans@core.ucl.ac.be, BE |
| |
Abstract: | be a capacitated directed graph with a source s and k terminals with demands , . We would like to concurrently route every demand on a single path from s to the corresponding terminal without violating the capacities. There are several interesting and important variations of
this unsplittable flow problem.
If the necessary cut condition is satisfied, we show how to compute an unsplittable flow satisfying the demands such that
the total flow through any edge exceeds its capacity by at most the maximum demand. For graphs in which all capacities are
at least the maximum demand, we therefore obtain an unsplittable flow with congestion at most 2, and this result is best possible.
Furthermore, we show that all demands can be routed unsplittably in 5 rounds, i.e., all demands can be collectively satisfied
by the union of 5 unsplittable flows. Finally, we show that 22.6% of the total demand can be satisfied unsplittably.
These results are extended to the case when the cut condition is not necessarily satisfied. We derive a 2-approximation algorithm
for congestion, a 5-approximation algorithm for the number of rounds and a -approximation algorithm for the maximum routable demand.
Received: July 12, 1998 |
| |
Keywords: | AMS Subject Classification (1991) Classes: 90B10 90C35 05C38 05C85 |
本文献已被 SpringerLink 等数据库收录! |
|