Degree-Constrained Minimum Spanning Hierarchies in Graphs
The minimum spanning tree problem in graphs under budget-type degree constraints (DCMST) is a well-known NP-hard problem. Spanning trees do not always exist, and the optimum can not be approximated within a constant factor. Recently, solutions have been proposed to solve degree-constrained spanning...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI AG
2024-10-01
|
| coleção: | Algorithms |
| Assuntos: | |
| Acesso em linha: | https://www.mdpi.com/1999-4893/17/10/467 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|