A note on approximating the min–max vertex disjoint paths on directed acyclic graphs
Under an Elsevier user license
open archive
Keywords
Approximation algorithm
Vertex disjoint paths
Rounding
FPTAS
Directed acyclic graph
Cited by (0)
Copyright © 2010 Elsevier Inc. All rights reserved.