Minimum rectilinear Steiner tree of \(n\) points in the unit square
type: Item
instance of: scholarly article
title: Minimum rectilinear Steiner tree of \(n\) points in the unit square
zbMATH Open document ID: 1428.05053
author: Adrian Dumitrescu
author: Minghui Jiang
published in: Computational Geometry
publication date: 2018-02-19T00:00:00Z
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6840490
zbMATH Keywords: minimum rectilinear Steiner tree
zbMATH Keywords: integer partition
zbMATH Keywords: packing
zbMATH Keywords: covering
MaRDI profile type: Publication
full work available at URL: j.comgeo.2017.06.007
OpenAlex ID: W2725261268
cites work: Worst-case ratios of networks in the rectilinear plane
cites work: On Steiner trees for bounded point sets
cites work: The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
cites work: Über einen geometrischen Satz
cites work: The shortest path and the shortest road through n points
cites work: Q4155835
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Q4198056
cites work: Steiner Minimal Trees
cites work: On Steiner’s Problem with Rectilinear Distance
cites work: On Steiner Minimal Trees with Rectilinear Distance
cites work: How Long Can a Euclidean Traveling Salesman Tour Be?
cites work: A course in combinatorics.
cites work: Geometric Spanner Networks
cites work: Fast heuristic algorithms for rectilinear Steiner trees
cites work: Q3922181
cites work: Lower bounds for rectilinear Steiner trees in bounded space
cites work: Worst-case minimum rectilinear Steiner trees in all dimensions
cites work: On the Shortest Path Through a Number of Points
cites work: Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
DOI: 10.1016/J.COMGEO.2017.06.007
Recommended article: Minimal Steiner trees for rectangular arrays of lattice points
Recommended article: Q3779760
Recommended article: A rectilinear steiner minimal tree algorithm for convex point sets
Recommended article: Approximations for Steiner trees with minimum number of Steiner points
Recommended article: A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
Recommended article: Approximating minimum Steiner point trees in Minkowski planes
Recommended article: Worst-case minimum rectilinear Steiner trees in all dimensions
Recommended article: Q3970808
Recommended article: Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
description: scientific article; zbMATH DE number 6840490