Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max (Q5212835)
From MaRDI portal
!
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 7160568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max |
scientific article; zbMATH DE number 7160568 |
Statements
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max (English)
0 references
30 January 2020
0 references
approximation schemes
0 references
fine-grained complexity
0 references
hardness of approximation
0 references
strongly polynomial algorithms
0 references
0.8021716475486755
0 references
0.7901850938796997
0 references
0.7727783918380737
0 references
0.7719606757164001
0 references
0.7695950865745544
0 references
