A Note on the Inapproximability of Induced Disjoint Paths

Gaoxiu Dong, Weidong Chen

We study the inapproximability of the induced disjoint paths problem on an arbitrary $n$-node $m$-edge undirected graph, which is to connect the maximum number of the $k$ source-si…