| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 430375 | Journal of Computer and System Sciences | 2011 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
