Revisiting search methods for the bounded-diameter minimum spanning tree problem (Q6855032)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8162578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting search methods for the bounded-diameter minimum spanning tree problem |
scientific article; zbMATH DE number 8162578 |
Statements
Revisiting search methods for the bounded-diameter minimum spanning tree problem (English)
0 references
23 February 2026
0 references
spanning tree
0 references
bounded-diameter minimum spanning tree
0 references
iterated local search (ILS)
0 references
heuristics
0 references
0 references
0 references
0 references
