Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays (Q4575807)
From MaRDI portal
scientific article; zbMATH DE number 6904095
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
