COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ1 AND ℓ2 METRIC SPACES

DOI10.1142/S1793830909000403zbMath1194.05020OpenAlexW2089567775MaRDI QIDQ5189992

Mareels, Iven M. Y., Doreen Anne Thomas, Jia Feng Weng

Publication date: 11 March 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830909000403

zbMATH Keywords

metric spaceSteiner pointsSteiner treephylogenetic treeprobability Steiner minimum tree

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Related Items

Probability Steiner trees and maximum parsimony in phylogenetic analysis

Cites Work

• Locally minimal uniformly oriented shortest networks
• The Steiner tree problem
• Minimum networks for four points in space
• Reducing the Steiner Problem in a Normed Space
• Minimum cost flow‐dependent communication networks
• Gradient-constrained minimum networks. I: Fundamentals.