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.

• Type: Conference
• Year: 2007
• Where: AAIM
• Authors: Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
• Keywords: AAIM 2007, Acyclic Directed Graph, Algorithms, Disjoint Paths, Distinct Nodes