On the Exact Location of Steiner Points in General Dimension

DOI10.1137/0221013zbMath0749.52007OpenAlexW2500374022MaRDI QIDQ3990108

Timothy Law Snyder

Publication date: 28 June 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0221013

zbMATH Keywords

rectilinear Steiner trees\(L_1\)-metricHanan's theorem

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Operations research and management science (90B99) Other problems of combinatorial convexity (52A37) Geometric constructions in real or complex geometry (51M15) Euclidean geometries (general) and generalizations (51M05)

Related Items

Two-level rectilinear Steiner trees ⋮ Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ Worst-case minimum rectilinear Steiner trees in all dimensions ⋮ A catalog of Hanan grid problems ⋮ Lower bounds for rectilinear Steiner trees in bounded space