Non-crossing of plane minimal spanning and minimal T1 networks

DOI10.1016/0012-365X(95)00071-4zbMath0892.05016OpenAlexW1964863922WikidataQ127155279 ScholiaQ127155279MaRDI QIDQ1377869

T. Cole

Publication date: 12 May 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00071-4

zbMATH Keywords

Steiner networksminimal spanning treeshortest networksT1 networks

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• A variational approach to the Steiner network problem
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• Some remarks on the Steiner problem
• On the Problem of Steiner
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees

This page was built for publication: Non-crossing of plane minimal spanning and minimal T1 networks