Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Steiner's problem in graphs: heuristic methods
Discrete Applied Mathematics - Special issue: combinatorial methods in VLSI
A faster approximation algorithm for the Steiner tree problem in graphs
Information Processing Letters
Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for the Steiner problem in networks
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
RNC-Approximation Algorithms for the Steiner Problem
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Primal-dual approaches to the Steiner problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Better approximation bounds for the network and Euclidean Steiner tree problems
Better approximation bounds for the network and Euclidean Steiner tree problems
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
New performance-driven FPGA routing algorithms
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
In this experimental study we consider contraction-based Steiner tree approximations. This class contains the only approximation algorithms that guarantee a constant approximation ratio below 2 and still may be applicable in practice. Despite their vivid evolution in theory, these algorithms have, to our knowledge, never been thoroughly investigated in practice before, which is particularly interesting as most of these algorithms' approximation guarantees only hold when some (constant) parameter k tends to infinity, while the running time is exponentially dependent on this very k. We investigate different implementation aspects and parameter choices which finally allow us to construct algorithms feasible for practical use. Then we compare these algorithms against each other and against state-of-the-art approaches.