Skip to main content
SpringerLink
Log in

Dynamic Programming for Minimum Steiner Trees

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Center for Applied Computer Science Cologne, Group AFS, University of Cologne, Weyertal 80 , 50931 Koln, Germany

    B. Fuchs

  2. Department of Applied Mathematics, Faculty of EEMCS, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands

    W. Kern & X. Wang

  3. Computer Science Department, RWTH Aachen University, 52056 Aachen, Germany

    D. Molle, S. Richter & P. Rossmanith

Authors
  1. B. Fuchs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. Kern
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Molle
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. Richter
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. P. Rossmanith
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. X. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. Rossmanith.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fuchs, B., Kern, W., Molle, D. et al. Dynamic Programming for Minimum Steiner Trees. Theory Comput Syst 41, 493–500 (2007). https://doi.org/10.1007/s00224-007-1324-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-1324-4

Keywords

Search

Navigation