Cargando…
On the approximability of the fixed-tree balanced minimum evolution problem
The Fixed-Tree BMEP (FT-BMEP) is a special case of the Balanced Minimum Evolution Problem (BMEP) that consists of finding the assignment of a set of n taxa to the n leaves of a given unrooted binary tree so as to minimize the BMEP objective function. Deciding the computational complexity of the FT-B...
Autor principal: | Frohn, Martin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7778423/ https://www.ncbi.nlm.nih.gov/pubmed/33425038 http://dx.doi.org/10.1007/s11590-020-01677-x |
Ejemplares similares
-
An evolution strategy approach for the balanced minimum evolution problem
por: Gasparin, Andrea, et al.
Publicado: (2023) -
On Approximability of Minimum Bisection and Related Partition Problems
por: Karpinski, M
Publicado: (2003) -
An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length
por: Shin, Donghoon, et al.
Publicado: (2023) -
Approximate solutions of common fixed-point problems /
por: Zaslavski, Alexander J.
Publicado: (2016) -
Approximate solutions of common fixed-point problems
por: Zaslavski, Alexander J
Publicado: (2016)