Pseudo-Gilbert-Steiner trees

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199905)33:3<175::AID-NET3>3.0.CO;2-L" /><175::AID-NET3>3.0.CO;2-L 10.1002/(SICI)1097-0037(199905)33:3<175::AID-NET3>3.0.CO;2-LzbMath0923.05016OpenAlexW2022712078MaRDI QIDQ4254352

No author found.

Publication date: 2 November 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199905)33:3<175::aid-net3>3.0.co;2-l

zbMATH Keywords

Steiner minimal tree problemGilbert network problemMelzak's methodpseudo-Gilbert-Steiner trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05)

Related Items (1)

The Gilbert arborescence problem

Cites Work

• An Improved Algorithm for Steiner Trees
• Degenerate Gilbert—Steiner trees
• Interconnecting networks in the plane: The steiner case

This page was built for publication: Pseudo-Gilbert-Steiner trees