Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays (Q4575807): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1610.05155 / rank | |||
Normal rank | |||
Latest revision as of 18:27, 19 April 2024
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
