FPT Inapproximability of Directed Cut and Connectivity Problems
From MaRDI portal
Publication:5875540
DOI10.4230/LIPIcs.IPEC.2019.8OpenAlexW2997610302MaRDI QIDQ5875540
Andreas Emil Feldmann, Rajesh Chitnis
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1910.01934
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
A survey of parameterized algorithms and the complexity of edge modification ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
This page was built for publication: FPT Inapproximability of Directed Cut and Connectivity Problems
