Efficient Algorithms for k-Disjoint Paths Problems on DAGs

Authors:
Rudolf Fleischer;Qi Ge;Jian Li;Hong Zhu
Affiliations:
Shanghai Key Laboratory of Intelligent Information Processing, Department of Computer Science and Engineering, Fudan University, Shanghai, China;Shanghai Key Laboratory of Intelligent Information Processing, Department of Computer Science and Engineering, Fudan University, Shanghai, China;Shanghai Key Laboratory of Intelligent Information Processing, Department of Computer Science and Engineering, Fudan University, Shanghai, China;Shanghai Key Laboratory of Intelligent Information Processing, Department of Computer Science and Engineering, Fudan University, Shanghai, China
Venue:
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Year:
2007

Citing 7
Cited 3

The complexity of finding two disjoint paths with min-max objective function

Discrete Applied Mathematics
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

Journal of the ACM (JACM)
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
Finding two disjoint paths in a network with normalized α+-MIN-SUM objective function

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

Journal of Computer and System Sciences
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs

Journal of Computer and System Sciences
Scheduling of vehicles in transportation networks

Nets4Cars/Nets4Trains'12 Proceedings of the 4th international conference on Communication Technologies for Vehicles

Quantified Score

Hi-index	0.01

Visualization

Abstract

Given an acyclic directed graph and two distinct nodes sand t, we consider the problem of finding kdisjoint paths from sto tsatisfying some objective. We consider four objectives, MinMax, Balanced, MinSum-MinMinand 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 forth one, we propose a general and efficient polynomial-time algorithm.