Dynamic Programming for Minimum Steiner Trees

  title={Dynamic Programming for Minimum Steiner Trees},
  author={B. Fuchs and W. Kern and D. M{\"o}lle and S. Richter and P. Rossmanith and X. Wang},
  journal={Theory of Computing Systems},
  • B. Fuchs, W. Kern, +3 authors X. Wang
  • Published 2007
  • Mathematics, Computer Science
  • Theory of Computing Systems
  • 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). 
    67 Citations

    Figures and Topics from this paper

    Faster algorithm for optimum Steiner trees
    • J. Vygen
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 2011
    • 14
    • Highly Influenced
    • PDF
    Parameterized Complexity of Arc-Weighted Directed Steiner Problems
    • 16
    • PDF
    Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
    • 24
    • PDF
    Exact algorithms for the Steiner Tree Problem
    • PDF
    Computing Optimal Steiner Trees in Polynomial Space
    • 14
    • PDF
    Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph
    • 6


    A Faster Algorithm for the Steiner Tree Problem
    • 106
    • PDF
    The steiner problem in graphs
    • 646
    Exact Algorithms for Plane Steiner Tree Problems: A Computational Study
    • 190
    On exact solutions for the rectilinear Steiner tree problem
    • 19
    Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time
    • 19
    On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results
    • 14
    • Highly Influential
    The Rectilinear Steiner Tree Problem in NP Complete
    • 1,021
    Approximation Algorithms for the Steiner Tree Problem in Graphs
    • 79
    On Steiner Minimal Trees with Rectilinear Distance
    • 425
    Optimal rectilinear Steiner minimal trees
    • Proceedings of the Sixth Canadian Conference on Computational Geometry,
    • 1994