Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation (Q4965840)
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: Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation |
scientific article; zbMATH DE number 7319004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation |
scientific article; zbMATH DE number 7319004 |
Statements
10 March 2021
0 references
Gromov-Hausdorff distance
0 references
minimum spanning tree
0 references
Borsuk problem
0 references
chromatic number
0 references
clique covering
0 references
metric geometry
0 references
discrete optimisation
0 references
0 references
0 references
0 references
0.8375104665756226
0 references
0.7777987718582153
0 references
0.7599486708641052
0 references
0.7587617635726929
0 references
0.7570260763168335
0 references
