A Simulated Annealing algorithm using the Node-depth Phylogenetic structure for the Degree-Constrained Minimum Spanning Tree problem
The degree-constrained minimum spanning tree problem (DCMST) is an NP-hard optimization problem defined on connected weighted graphs. It consists of computing a minimum-cost spanning tree of the graph whose nodes have degrees smaller or equal to a predefined constant D. This paper proposes a new he...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Centro Latinoamericano de Estudios en Informática
2026-03-01
|
| Серии: | CLEI Electronic Journal |
| Предметы: | |
| Online-ссылка: | https://www.clei.org/cleiej/index.php/cleiej/article/view/951 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|