Approximating the balanced minimum evolution problem

DOI10.1016/j.orl.2011.10.003zbMath1242.90275arXiv1104.1080OpenAlexW2040026476MaRDI QIDQ433835

Samuel Fiorini, Gwenaël Joret

Publication date: 6 July 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.1080

zbMATH Keywords

approximation algorithmphylogenetic treebalanced minimum evolution problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (13)

Facets of the balanced minimal evolution polytope ⋮ A branch-price-and-cut algorithm for the minimum evolution problem ⋮ A tutorial on the balanced minimum evolution problem ⋮ An information theory perspective on the balanced minimum evolution problem ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ Expanding the class of global objective functions for dissimilarity-based hierarchical clustering ⋮ UPGMA and the normalized equidistant minimum evolution problem ⋮ The balanced minimum evolution problem under uncertain data ⋮ Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem ⋮ Enumerating vertices of the balanced minimum evolution polytope ⋮ On the approximability of the fixed-tree balanced minimum evolution problem ⋮ The Balanced Minimum Evolution Problem ⋮ On the balanced minimum evolution polytope

Cites Work

• Polyhedral geometry of phylogenetic rogue taxa
• Cyclic permutations and evolutionary trees
• The Balanced Minimum Evolution Problem
• Unnamed Item

This page was built for publication: Approximating the balanced minimum evolution problem