no code implementations • 26 Jan 2021 • Rajesh Chitnis
As a special case of our result, we obtain that Edge-Disjoint Paths on planar directed graphs is W[1]-hard parameterized by the number $k$ of terminal pairs.
Data Structures and Algorithms Discrete Mathematics
no code implementations • 20 Jul 2017 • Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi
We give a tight inapproximability result by showing that for $k$ no parameterized $(2-\varepsilon)$-approximation algorithm exists under Gap-ETH.
Data Structures and Algorithms Computational Complexity
