Parameterized Complexity and Approximability of the Maximum Node-Disjoint Paths Problem

The Maximum Node-Disjoint Paths problem is intractable under various structural parameterizations, but can be efficiently approximated for some of these parameters using FPT approximation schemes.