New algorithms for maximum disjoint paths based on tree-likeness
{{output}}
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/MaxNDP is currently... ...
