Faster algorithm for optimum Steiner trees

Authors:
Jens Vygen
Affiliations:
Research Institute for Discrete Mathematics, University of Bonn, Lennéstraíe 2, 53113 Bonn, Germany
Venue:
Information Processing Letters
Year:
2011

Citing 8
Cited 0

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Send-and-split method for minimum-concave-cost network flows

Mathematics of Operations Research
The steiner problem with edge lengths 1 and 2,

Information Processing Letters
A minimum spanning tree algorithm with inverse-Ackermann type complexity

Journal of the ACM (JACM)
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Dynamic Programming for Minimum Steiner Trees

Theory of Computing Systems
Faster Steiner Tree Computation in Polynomial-Space

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a new deterministic algorithm for the Steiner tree problem in weighted graphs. Its running time is O(nk2^k^+^(^l^o^g^"^2^k^)^(^l^o^g^"^2^n^)), where n is the number of vertices and k is the number of terminals. This is faster than all previously known algorithms if logn(loglogn)^3