Minimum bottleneck spanning trees with degree bounds (Q4642403)
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 6871400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum bottleneck spanning trees with degree bounds |
scientific article; zbMATH DE number 6871400 |
Statements
Minimum bottleneck spanning trees with degree bounds (English)
0 references
23 May 2018
0 references
minimum spanning trees
0 references
bottleneck objective
0 references
approximation algorithms
0 references
discrete geometry
0 references
bounded degree
0 references
combinatorial optimization
0 references
0.9239782691001892
0 references
0.9029797315597534
0 references
0.8814482688903809
0 references
0.8548456430435181
0 references
0.8202316761016846
0 references
