Some upper bounds for minimal trees
From MaRDI portal
Publication:1178229
DOI10.1016/0020-0190(91)90102-NzbMath0738.68039OpenAlexW1964674521MaRDI QIDQ1178229
Publication date: 26 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90102-n
upper boundsminimal treesEuclidean Steiner minimal treerectilinear minimal treerectilinear Steiner minimal tree
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- On Steiner trees for bounded point sets
- The shortest path and the shortest road through n points
- The Complexity of Computing Steiner Minimal Trees
- The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
- On Steiner’s Problem with Rectilinear Distance
- Steiner Minimal Trees