A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
[article]
2016
arXiv
pre-print
We study the classical NP-hard problems of finding maximum-size subsets from given sets of k terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint paths (MaxNDP) in a given graph. The approximability of MaxEDP/NDP is currently not well understood; the best known lower bound is Ω(^1/2-ϵn), assuming NP ⊆ ZPTIME(n^poly n). This constitutes a significant gap to the best known approximation upper bound of O(√(n)) due to Chekuri et al. (2006) and closing this gap is
arXiv:1603.01740v2
fatcat:t6f6bgaxpjbtxdngc2z4zdj7zi