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

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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. © 2010 Elsevier Inc.

Cite

CITATION STYLE

APA

Wu, B. Y. (2011). A note on approximating the min-max vertex disjoint paths on directed acyclic graphs. Journal of Computer and System Sciences, 77(6), 1054–1057. https://doi.org/10.1016/j.jcss.2010.08.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free