Degree bounded bottleneck spanning trees in three dimensions (Q2292155)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Degree bounded bottleneck spanning trees in three dimensions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degree bounded bottleneck spanning trees in three dimensions |
scientific article |
Statements
Degree bounded bottleneck spanning trees in three dimensions (English)
0 references
3 February 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
0 references
0 references
0 references
0.9239782691001892
0 references
0.8695368766784668
0 references
0.8644089102745056
0 references
0.8261367678642273
0 references
0.8261367082595825
0 references
