Faster exact algorithms for steiner trees in planar networks
From MaRDI portal
Publication:4206584
DOI10.1002/net.3230200110zbMath0687.90088OpenAlexW2031493401WikidataQ57311715 ScholiaQ57311715MaRDI QIDQ4206584
Publication date: 1990
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200110
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Dynamic programming (90C39)
Related Items (10)
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 ⋮ Polynomially solvable special cases of the Steiner problem in planar networks ⋮ The role of Steiner hulls in the solution to Steiner tree problems ⋮ A dynamic programming approach for the pipe network layout problem ⋮ A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets ⋮ Approximating the selected-internal Steiner tree ⋮ Computing optimal rectilinear Steiner trees: A survey and experimental evaluation ⋮ The Steiner tree problem for terminals on the boundary of a rectilinear polygon ⋮ On the terminal Steiner tree problem. ⋮ Tree polytope on 2-trees
Cites Work
This page was built for publication: Faster exact algorithms for steiner trees in planar networks
