Dynamic Programming for Minimum Steiner Trees

Authors:
B. Fuchs;W. Kern;D. Molle;S. Richter;P. Rossmanith;X. Wang
Affiliations:
Center for Applied Computer Science Cologne, Group AFS, University of Cologne, Weyertal 80, 50931 Koln, Germany;Department of Applied Mathematics, Faculty of EEMCS, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands;Computer Science Department, RWTH Aachen University, 52056 Aachen, Germany;Computer Science Department, RWTH Aachen University, 52056 Aachen, Germany;Computer Science Department, RWTH Aachen University, 52056 Aachen, Germany;Department of Applied Mathematics, Faculty of EEMCS, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Venue:
Theory of Computing Systems
Year:
2007

Citing 0
Cited 8

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
Approaches to the Steiner Problem in Networks

Algorithmics of Large and Complex Networks
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Saving space by algebraization

Proceedings of the forty-second ACM symposium on Theory of computing
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
Faster algorithm for optimum Steiner trees

Information Processing Letters
Enumerate and expand: new runtime bounds for vertex cover variants

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new dynamic programming algorithm that solves the minimum Steiner tree problem on graphs with k terminals in time O*(ck) for any c 2. This improves the running time of the previously fastest parameterized algorithm by Dreyfus-Wagner of order O*(3k) and the so-called "full set dynamic programming" algorithm solving rectilinear instances in time O*(2.38k).