Dynamic Programming for Minimum Steiner Trees

2007/10/01 by B. Fuchs, Bernhard Fuchs, W. Kern +9 · 3 citations
Computer Science · Engineering · Mathematics · #Algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Dynamic programming #Formal Methods in Verification #Mathematical optimization #Mathematics #Order (exchange) #Parameterized complexity #Programming language #Running time #Set (abstract data type) #Steiner tree problem #Tree (set theory) #VLSI and FPGA Design Techniques

paper · doi:10.1007/s00224-007-1324-4

crossref issued 2007/10/01 · crossref published 2007/10/01 · crossref published-print 2007/10/01 · openalex publication_date 2007/10/01 · crossref created 2007/12/06 · crossref deposited 2019/05/24 · crossref indexed 2025/07/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Citations

• The steiner problem in graphs
• On Steiner Minimal Trees with Rectilinear Distance
• The Rectilinear Steiner Tree Problem is NP-Complete

Cited by

• Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree
• Saving space by algebraization
• Fourier meets möbius: fast subset convolution
• Steiner tree problem [wikipedia]