Reducing the Steiner Problem in a Normed Space

DOI10.1137/0221059zbMath0766.05019OpenAlexW2018943178MaRDI QIDQ4027866

Ding-Zhu Du, Frank K. Hwang

Publication date: 9 March 1993

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

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

zbMATH Keywords

normed spaceMinkowski spaceSteiner problemSteiner treeSteiner graph algorithms

Mathematics Subject Classification ID

Trees (05C05) Operations research and management science (90B99) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Related Items (10)

Two-level rectilinear Steiner trees ⋮ HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES ⋮ A tight lower bound for the Steiner ratio in Minkowski planes ⋮ Locally minimal uniformly oriented shortest networks ⋮ The Steiner ratio for the dual normed plane ⋮ COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ₁ AND ℓ₂ METRIC SPACES ⋮ Minimum Steiner trees in normed planes ⋮ Steiner trees for fixed orientation metrics ⋮ The Steiner Minimal Tree problem in the λ-geometry plane ⋮ Forbidden subpaths for Steiner minimum networks in uniform orientation metrics

This page was built for publication: Reducing the Steiner Problem in a Normed Space