Approximating min-mean-cycle for low-diameter graphs in near-optimal time and memory (Q5097012)
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 min-mean-cycle for low-diameter graphs in near-optimal time and memory |
scientific article; zbMATH DE number 7573358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating min-mean-cycle for low-diameter graphs in near-optimal time and memory |
scientific article; zbMATH DE number 7573358 |
Statements
Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory (English)
0 references
19 August 2022
0 references
min-mean-cycle
0 references
approximation algorithm
0 references
near-linear runtime
0 references
linear programming relaxation
0 references
entropic regularization
0 references
matrix balancing
0 references
0 references
0 references
0.8357077240943909
0 references
0.8259670734405518
0 references
0.7669377326965332
0 references
0.74272221326828
0 references
