Dynamic Programming for Minimum Steiner Trees

@article{Fuchs2007DynamicPF,
  title={Dynamic Programming for Minimum Steiner Trees},
  author={Bernhard Fuchs and Walter Kern and Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith and Xinhui Wang},
  journal={Theory of Computing Systems},
  year={2007},
  volume={41},
  pages={493-500}
}
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). 

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 38 CITATIONS

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices

Pavel Dvořák, Andreas Emil Feldmann, +3 authors Pavel Veselý
  • STACS
  • 2017
VIEW 27 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Faster algorithm for optimum Steiner trees

  • Inf. Process. Lett.
  • 2011
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED