Approximation algorithms for min-distance problems (Q5091199)
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: Approximation algorithms for min-distance problems |
scientific article; zbMATH DE number 7561539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for min-distance problems |
scientific article; zbMATH DE number 7561539 |
Statements
21 July 2022
0 references
fine-grained complexity
0 references
graph algorithms
0 references
diameter
0 references
radius
0 references
eccentricities
0 references
0 references
0.8466294407844543
0 references
0.83930903673172
0 references
0.8352814316749573
0 references
0.829224705696106
0 references
0.8180829882621765
0 references
