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
fully polynomial-time approximation schemes
scientific article; zbMATH DE number 5796725