1 code implementation • 2 Oct 2017 • Pavel Dvořák, Andreas Emil Feldmann, Dušan Knop, Tomáš Masařík, Tomáš Toufar, Pavel Veselý
We also prove that there is an EPAS and a PSAKS for Steiner Forest if in addition to the number of Steiner vertices, the number of connected components of an optimal solution is considered to be a parameter.
Data Structures and Algorithms Computational Complexity F.2.2; G.2.2
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
