Hello every one, I wonder if there is an exact or approximation algorithm for the following problem: given a complete weighted graph, find a a minimum spanning tree such that the degree of each non-leaf node is bigger than a constant number (say b).
Hello every one, I wonder if there is an exact or approximation algorithm for the following problem: given a complete weighted graph, find a a minimum spanning tree such that the degree of each non-leaf node is bigger than a constant number (say b).
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 161 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
Hm, it would be nice Challenge problem for CodeChef if solution is not found :)
ha, found it! the name of the problem is "min-degree bounded minimum spanning tree" and has been proved to be NP-hard, there are a few papers which have tried to solve it using an operational research approach.