Hardness of Balanced Mobiles - Université Paris Dauphine Access content directly
Conference Papers Year :

Hardness of Balanced Mobiles


Measuring tree dissimilarity and studying the shape of trees are important tasks in phylogenetics. One of the most studied shape properties is the notion of tree imbalance, which can be quantified by different indicators, such as the Colless index. Here, we study the generalization of the Colless index to mobiles, i.e., full binary trees in which each leaf has been assigned a positive integer weight. In particular, we focus on the problem Balanced Mobiles, which given as input n weights and a full binary tree on n leaves, asks to find an assignment of the weights to the leaves that minimizes the Colless index, i.e., the sum of the imbalances of the internal nodes (computed as the difference between the total weight of the left and right subtrees of the node considered). We prove that this problem is strongly NP-hard, answering an open question given at IWOCA 2016.
Fichier principal
Vignette du fichier
Balancing_numbers_on_binary_trees.pdf (336.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04054238 , version 1 (31-03-2023)


  • HAL Id : hal-04054238 , version 1


Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora. Hardness of Balanced Mobiles. 34th International Workshop on Combinatorial Algorithms (IWOCA 2023), Jun 2023, Tainan, Taiwan. ⟨hal-04054238⟩
22 View
10 Download


Gmail Facebook Twitter LinkedIn More