A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368)
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 7057344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(o(n)\)-competitive deterministic algorithm for online matching on a line |
scientific article; zbMATH DE number 7057344 |
Statements
A \(o(n)\)-competitive deterministic algorithm for online matching on a line (English)
0 references
21 May 2019
0 references
online algorithms
0 references
competitive analysis
0 references
metric matching
0 references
search problems
0 references
0 references
0.9630878567695618
0 references
0.9035958647727966
0 references
0.8877215385437012
0 references
0.8791720867156982
0 references
0.8365065455436707
0 references
