Pseudo-Gilbert-Steiner trees

DOI10.1002/(SICI)1097-0037(199905)33:3%3C175::AID-NET3%3E3.0.CO;2-LzbMATH Open0923.05016OpenAlexW2022712078MaRDI QIDQ4254352FDOQ4254352

Authors:

Publication date: 2 November 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199905)33:3%3C175::aid-net3%3E3.0.co;2-l

Recommendations

• Degenerate Gilbert—Steiner trees
• The Gilbert and Pollak conjecture—a generalization
• The Gilbert arborescence problem
• scientific article; zbMATH DE number 939025

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)

Cites Work

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

Cited In (3)

• Degenerate Gilbert—Steiner trees
• The Gilbert arborescence problem
• Minimum cost flow‐dependent communication networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254352)