Better approximation algorithms for the graph diameter (Q5384040)
From MaRDI portal
!
WARNING
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 7069396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better approximation algorithms for the graph diameter |
scientific article; zbMATH DE number 7069396 |
Statements
Better Approximation Algorithms for the Graph Diameter (English)
0 references
20 June 2019
0 references
0.9213231205940248
0 references
0.9134639501571656
0 references
0.9099727272987366
0 references
0.871415913105011
0 references
0.871415913105011
0 references
