Minimum rectilinear Steiner tree of \(n\) points in the unit square

DOI10.1016/j.comgeo.2017.06.007zbMath1428.05053OpenAlexW2725261268MaRDI QIDQ1699296

Adrian Dumitrescu, Ming-Hui Jiang

Publication date: 19 February 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2017.06.007

zbMATH Keywords

coveringpackinginteger partitionminimum rectilinear Steiner tree

Mathematics Subject Classification ID

Trees (05C05)

Related Items

Unnamed Item, On the Stretch Factor of Polygonal Chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for rectilinear Steiner trees in bounded space
• Fast heuristic algorithms for rectilinear Steiner trees
• On Steiner trees for bounded point sets
• Worst-case minimum rectilinear Steiner trees in all dimensions
• Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
• Über einen geometrischen Satz
• Worst-case ratios of networks in the rectilinear plane
• The shortest path and the shortest road through n points
• Geometric Spanner Networks
• On Steiner Minimal Trees with Rectilinear Distance
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• 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
• How Long Can a Euclidean Traveling Salesman Tour Be?
• On Steiner’s Problem with Rectilinear Distance
• Steiner Minimal Trees
• On the Shortest Path Through a Number of Points