Approximating all-points furthest pairs and maximum spanning trees in metric spaces (Q6569899)
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: Approximating all-points furthest pairs and maximum spanning trees in metric spaces |
scientific article; zbMATH DE number 7878891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating all-points furthest pairs and maximum spanning trees in metric spaces |
scientific article; zbMATH DE number 7878891 |
Statements
Approximating all-points furthest pairs and maximum spanning trees in metric spaces (English)
0 references
9 July 2024
0 references
metric spaces
0 references
sublinear algorithms
0 references
eccentricities
0 references
maximum spanning trees
0 references
0 references
