Steiner Tree Approximations in Graphs and Hypergraphs
The construction of partial minimum spanning trees is an NP-hard problem, leading to the development of various heuristic algorithms. Existing heuristics, including Kruskal’s algorithm, frequently employ shortest paths to connect tree components. This study introduces an approximate algorithm for co...
Wedi'i Gadw mewn:
| Prif Awduron: | , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
MDPI AG
2026-03-01
|
| Cyfres: | Algorithms |
| Pynciau: | |
| Mynediad Ar-lein: | https://www.mdpi.com/1999-4893/19/3/232 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|