A faster algorithm for the steiner tree problem

Authors:
Daniel Mölle;Stefan Richter;Peter Rossmanith
Affiliations:
Department of Computer Science, RWTH Aachen University, Fed. Rep. of Germany;Department of Computer Science, RWTH Aachen University, Fed. Rep. of Germany;Department of Computer Science, RWTH Aachen University, Fed. Rep. of Germany
Venue:
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Year:
2006

Citing 6
Cited 14

The steiner problem with edge lengths 1 and 2,

Information Processing Letters
Finding maximum independent sets in sparse and general 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 upper bounds for 3-SAT

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Measure and conquer: domination – a case study

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithms based on the treewidth of sparse graphs

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

A factoring approach for the Steiner tree problem in undirected networks

Information Sciences: an International Journal
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Faster Steiner Tree Computation in Polynomial-Space

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Vertex and edge covers with clustering properties: Complexity and algorithms

Journal of Discrete Algorithms
Reoptimization of Steiner trees: Changing the terminal set

Theoretical Computer Science
On the hardness of reoptimization

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
An improved LP-based approximation for steiner tree

Proceedings of the forty-second ACM symposium on Theory of computing
Algorithms and constraint programming

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Solving connected dominating set faster than 2n

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Enumerate and expand: improved algorithms for connected vertex cover and tree cover

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Enumerate and expand: new runtime bounds for vertex cover variants

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Intuitive algorithms and t-vertex cover

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Steiner Tree Approximation via Iterative Randomized Rounding

Journal of the ACM (JACM)
Exponential approximation schemata for some network design problems

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

For decades, the algorithm providing the smallest proven worst-case running time (with respect to the number of terminals) for the Steiner tree problem has been the one by Dreyfus and Wagner. In this paper, a new algorithm is developed, which improves the running time from O(3kn+2kn2+n3) to (2+δ)k ·poly(n) for arbitrary but fixed δ 0. Like its predecessor, this algorithm follows the dynamic programming paradigm. Whereas in effect the Dreyfus–Wagner recursion splits the optimal Steiner tree in two parts of arbitrary sizes, our approach looks for a set of nodes that separate the tree into parts containing only few terminals. It is then possible to solve an instance of the Steiner tree problem more efficiently by combining partial solutions.