Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays (Q4575807)
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 6904095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays |
scientific article; zbMATH DE number 6904095 |
Statements
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays (English)
0 references
16 July 2018
0 references
0.90833586
0 references
0.86634207
0 references
0.86634207
0 references
0.86017585
0 references
0.85446507
0 references
0 references
0.84767663
0 references
