DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION (Q5212976)
From MaRDI portal
!
WARNING
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 7160904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION |
scientific article; zbMATH DE number 7160904 |
Statements
DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION (English)
0 references
31 January 2020
0 references
minimum spanning trees
0 references
bottleneck objective
0 references
approximation algorithms
0 references
discrete geometry
0 references
bounded degree
0 references
combinatorial optimisation
0 references
