Sciweavers

AAIM
2007
Springer

Efficient Algorithms for k -Disjoint Paths Problems on DAGs

13 years 7 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectives, MinMax, Balanced, MinSum-MinMin, and MinSum-MinMax. We use the algorithm by Perl-Shiloach and labelling and scaling techniques to devise an FPTAS for the first three objectives. For the fourth one, we propose a general and efficient polynomial-time algorithm.
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2007
Where AAIM
Authors Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
Comments (0)