Degree-Constrained Steiner Problem in Graphs with Capacity Constraints
The degree-constrained Steiner problem in graphs is well known in the literature. In an undirected graph, positive integer degree bounds are associated with nodes and positive costs with the edges. The goal is to find the minimum cost tree spanning a given node set while respecting the degree bounds...
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI AG
2024-11-01
|
| Serie: | Mathematics |
| Soggetti: | |
| Accesso online: | https://www.mdpi.com/2227-7390/12/22/3521 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|