Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

DOI10.1137/18M1209489zbMath1462.68138MaRDI QIDQ5857009

Pavel Dvořák, Andreas Emil Feldmann, Pavel Veselý, Tomáš Masařík, Dušan Knop, Tomáš Toufar

Publication date: 30 March 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximation algorithms; Steiner tree; parameterized algorithms; Steiner forest

Mathematics Subject Classification ID

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

68Q27: Parameterized complexity, tractability and kernelization

Uses Software

• GitHub