Euclidean Steiner trees optimal with respect to swapping 4-point subtrees

DOI10.1007/s11590-013-0660-3zbMath1292.90306OpenAlexW2029162204WikidataQ61714590 ScholiaQ61714590MaRDI QIDQ2448203

Doreen Anne Thomas, Jia Feng Weng

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11343/283075

zbMATH Keywords

computational experimentsSteiner minimal treeSteiner pointquasi-indicator

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Degree bounded bottleneck spanning trees in three dimensions

Uses Software

• CVX

Cites Work

• Probability Steiner trees and maximum parsimony in phylogenetic analysis
• A variational approach to the Steiner network problem
• An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
• How to find Steiner minimal trees in Euclidean \(d\)-space
• The Steiner tree problem
• Some remarks on the Steiner problem
• Variational approach and Steiner minimal trees on four points
• Statistical methods in bioinformatics. An introduction.
• Minimum networks for four points in space
• On the Problem of Steiner
• IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE
• The Complexity of Computing Steiner Minimal Trees
• A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
• Steiner Minimal Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Euclidean Steiner trees optimal with respect to swapping 4-point subtrees