Minimal Steiner trees for rectangular arrays of lattice points

DOI10.1006/jcta.1996.2751zbMath0883.05038OpenAlexW2063178228MaRDI QIDQ1364229

Doreen Anne Thomas, Joachim Hyam Rubinstein, Jia Feng Weng, Marcus Brazil, Nicholas C. Wormald

Publication date: 5 February 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1996.2751

zbMATH Keywords

lattice pointsfull components of a Steiner treeminimal Steiner trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (6)

Full minimal Steiner trees on lattice sets ⋮ Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds ⋮ On the structure and complexity of the 2-connected Steiner network problem in the plane ⋮ On the restricted 1-Steiner tree problem ⋮ Approximating minimum Steiner point trees in Minkowski planes ⋮ On the restricted \(k\)-Steiner tree problem

Cites Work

• The Steiner tree problem
• Full minimal Steiner trees on lattice sets
• Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices
• Steiner Trees for Ladders
• Steiner Trees on a Checkerboard

This page was built for publication: Minimal Steiner trees for rectangular arrays of lattice points