DISPATCH: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q1757767)
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: DISPATCH: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals |
scientific article; zbMATH DE number 7002069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DISPATCH: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals |
scientific article; zbMATH DE number 7002069 |
Statements
Dispatch: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (English)
0 references
15 January 2019
0 references
perfect matching
0 references
i.i.d. arrivals
0 references
competitive ratio
0 references
0.9792089462280272
0 references
0.8161789178848267
0 references
0.7933585047721863
0 references
0.7885837554931641
0 references
