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

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.