Full minimal Steiner trees on lattice sets
From MaRDI portal
Publication:1356020
DOI10.1006/jcta.1996.2752zbMath0874.05018OpenAlexW2056026586MaRDI QIDQ1356020
Marcus Brazil, Nicholas C. Wormald, Doreen Anne Thomas, Jia Feng Weng, Joachim Hyam Rubinstein
Publication date: 9 November 1997
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.2752
Related Items (4)
Minimal Steiner trees for rectangular arrays of lattice points ⋮ Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds ⋮ On the restricted 1-Steiner tree problem ⋮ On the restricted \(k\)-Steiner tree problem
Cites Work
- Unnamed Item
- A variational approach to the Steiner network problem
- Steiner minimal trees on sets of four points
- Some remarks on the Steiner problem
- Minimal Steiner trees for rectangular arrays of lattice points
- Expansion of linear Steiner trees
- Minimal Steiner trees for \(2^ k \times 2^ k\) square lattices
- On the Problem of Steiner
- Steiner Trees for Ladders
- The Complexity of Computing Steiner Minimal Trees
- Steiner Trees on a Checkerboard
- Steiner Minimal Trees
- On the Efficiency of the Algorithm for Steiner Minimal Trees
This page was built for publication: Full minimal Steiner trees on lattice sets
