Dvorák, P., Feldmann, A.E. orcid.org/0000-0001-6229-5332, Knop, D. et al. (3 more authors) (2018) Parameterized approximation schemes for steiner trees with small number of Steiner vertices. In: Niedermeier, R. and Vall, B., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 28 Feb - 03 Mar 2018, Caen, France. Leibniz International Proceedings in Informatics, 96 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , Dagstuhl, Germany , 26:1-26:15. ISBN 978-3-95977-062-0
Abstract
We study the Steiner Tree problem, in which a set of terminal vertices needs to be connected in the cheapest possible way in an edge-weighted graph. This problem has been extensively studied from the viewpoint of approximation and also parametrization. In particular, on one hand Steiner Tree is known to be APX-hard, and W[2]-hard on the other, if parameterized by the number of non-terminals (Steiner vertices) in the optimum solution. In contrast to this we give an efficient parameterized approximation scheme (EPAS), which circumvents both hardness results. Moreover, our methods imply the existence of a polynomial size approximate kernelization scheme (PSAKS) for the considered parameter. We further study the parameterized approximability of other variants of Steiner Tree, such as Directed Steiner Tree and Steiner Forest. For neither of these an EPAS is likely to exist for the studied parameter: For Steiner Forest an easy observation shows that the problem is APX-hard, even if the input graph contains no Steiner vertices. For Directed Steiner Tree we prove that computing a constant approximation for this parameter is W[1]-hard. Nevertheless, we show that an EPAS exists for Unweighted Directed Steiner Tree. Also we 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.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2018 The Authors. This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (https://creativecommons.org/licenses/by/3.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
Keywords: | Steiner Tree; Steiner Forest; Approximation Algorithms; Parameterized Algorithms; Lossy Kernelization |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 28 Jun 2023 14:49 |
Last Modified: | 28 Jun 2023 14:49 |
Status: | Published |
Publisher: | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik |
Series Name: | Leibniz International Proceedings in Informatics |
Refereed: | Yes |
Identification Number: | 10.4230/LIPIcs.STACS.2018.26 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:200962 |