Length-minimizing LED trees

DOI10.1007/S43069-025-00416-1MaRDI QIDQ7019975zbMATH OpenFDO

Authors Mariana Sarkociová Remešíková, Peter Sarkoci, Mária Trnovská

Publication date 5 March 2025

Published in SN Operations Research Forum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S43069-025-00416-1

zbMATH Keywords

computational phylogenyEuclidean graphEuclidean treelanguage evolutionLED treelength-minimizing treephylogenetic treeSteiner tree

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Nonconvex programming, global optimization (90C26) Problems related to evolution (92D15)

Cites work

• D-Levels locally homogeneous graphs
• A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
• Graphs with the same peripheral and center eccentric vertices
• How to find Steiner minimal trees in Euclidean \(d\)-space
• scientific article; zbMATH DE number 637283 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
• Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
• On the Exact Location of Steiner Points in General Dimension
• On the history of the Euclidean Steiner tree problem
• Probability Steiner trees and maximum parsimony in phylogenetic analysis
• Two classes of graphs related to extremal eccentricities

Cited in

(1)

• Intersections of rotational quadratic hypersurfaces with a common focus

This page was built for publication: Length-minimizing LED trees

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