Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs [chapter]

Stavros G. Kolliopoulos, Clifford Stein
1998 Lecture Notes in Computer Science  
The edge and vertex-disjoint path problems together with their unsplittable flow generalization are NP-hard problems with a multitude of applications in areas such as routing, scheduling and bin packing. Given the hardness of the problems, we study polynomial-time approximation algorithms with bounded performance guarantees. We introduce techniques which yield new algorithms for a wide range of disjoint-path problems. We use two basic techniques. First, we propose simple greedy algorithms for
more » ... ge-and vertex-disjoint paths and second, we propose the use of a framework based on packing integer programs for more general problems such as unsplittable flow. As part of our tools we develop improved approximation algorithms for a class of packing integer programs, a result that we believe is of independent interest.
doi:10.1007/3-540-69346-7_12 fatcat:gh576xwwcfbelbhh64qu32j5iu