Minimum Networks in Uniform Orientation Metrics
From MaRDI portal
Publication:2706126
DOI10.1137/S0097539798347190zbMath0973.05022MaRDI QIDQ2706126
Marcus Brazil, Jia Feng Weng, Doreen Anne Thomas
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Trees (05C05) Operations research and management science (90B99) Applications of graph theory to circuits and networks (94C15)
Related Items (9)
Rotationally optimal spanning and Steiner trees in uniform orientation metrics ⋮ HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES ⋮ Locally minimal uniformly oriented shortest networks ⋮ Steiner hull algorithm for the uniform orientation metrics ⋮ A near linear time approximation scheme for Steiner tree among obstacles in the plane ⋮ Steiner trees for fixed orientation metrics ⋮ Quantitative Illumination of Convex Bodies and Vertex Degrees of Geometric Steiner Minimal Trees ⋮ On the location of Steiner points in uniformly-oriented Steiner trees. ⋮ Forbidden subpaths for Steiner minimum networks in uniform orientation metrics
This page was built for publication: Minimum Networks in Uniform Orientation Metrics
