Dynamic programming for minimum Steiner trees

From MaRDI portal
Publication:2464320

DOI10.1007/s00224-007-1324-4zbMath1148.68038OpenAlexW2003753063MaRDI QIDQ2464320

Bernhard Fuchs, Xinhui Wang, Peter Rossmanith, Stefan Richter, Walter Kern, Daniel Mölle

Publication date: 19 December 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://e-archive.informatik.uni-koeln.de/492/2/zaik2005-492.pdf




Related Items (23)

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner TreeOn Directed Steiner Trees with Multiple RootsComputing optimal Steiner trees in polynomial spaceExtending the kernel for planar Steiner tree to the number of Steiner verticesParameterized Single-Exponential Time Polynomial Space Algorithm for Steiner TreeProbability Steiner trees and maximum parsimony in phylogenetic analysisOptimization of urban transport; an alternative to checkerboard towns plansSolving Steiner trees: Recent advances, challenges, and perspectivesAn ETH-tight algorithm for bidirected Steiner connectivityFaster algorithm for optimum Steiner treesSharp separation and applications to exact and parameterized algorithmsDijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithmFast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problemsParameterized study of Steiner tree on unit disk graphsFaster Steiner Tree Computation in Polynomial-SpaceAn FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodesThe number of tree stars is \(O^{*}(1.357^k)\)Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified ViewParameterized Complexity of Directed Steiner Tree on Sparse GraphsApproaches to the Steiner Problem in NetworksComplexity of the Steiner Network Problem with Respect to the Number of TerminalsVertex and edge covers with clustering properties: Complexity and algorithmsParameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices




This page was built for publication: Dynamic programming for minimum Steiner trees