A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q3453279)
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 6512651
| 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 6512651 |
Statements
A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line (English)
0 references
20 November 2015
0 references
0 references
0.9630878567695618
0 references
0.876191258430481
0 references
0.8669470548629761
0 references
0.846403181552887
0 references
0.8170105814933777
0 references
