A note on approximating the min-max vertex disjoint paths on directed acyclic graphs

Authors:
Bang Ye Wu
Affiliations:
Dept. of Computer Science and Information Engineering, National Chung Cheng University, ChiaYi, Taiwan 621, ROC
Venue:
Journal of Computer and System Sciences
Year:
2011

Citing 7
Cited 0

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

Discrete Applied Mathematics
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
An improved FPTAS for restricted shortest path

Information Processing Letters
Length-bounded disjoint paths in planar graphs

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Efficient Algorithms for k-Disjoint Paths Problems on DAGs

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
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 simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows that the FPTAS for the min-max disjoint paths problem on directed acyclic graphs by Yu et al. (2010) [7] can be improved by a rounding and searching technique.