Given an edge-weighted graph G and a node subset R, the Steiner tree problem asks for an R-spanning tree of minimum weight. There are several strong approximation algorithms for this NP-hard problem, but research on their practicality is still in its early stages. In this study, we investigate how the behavior of approximation algorithms changes when applying preprocessing routines first. In particular, the shrunken instances allow us to consider algorithm parameterizations that have been impractical before, shedding new light on the algorithms’ respective drawbacks and benefits.
CITATION STYLE
Beyer, S., & Chimani, M. (2015). The influence of preprocessing on steiner tree approximations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9486, pp. 601–616). Springer Verlag. https://doi.org/10.1007/978-3-319-26626-8_44
Mendeley helps you to discover research relevant for your work.