Dynamic matching with better-than-2 approximation in polylogarithmic update time (Q6538530)
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: Dynamic matching with better-than-2 approximation in polylogarithmic update time |
scientific article; zbMATH DE number 7847965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic matching with better-than-2 approximation in polylogarithmic update time |
scientific article; zbMATH DE number 7847965 |
Statements
Dynamic matching with better-than-2 approximation in polylogarithmic update time (English)
0 references
14 May 2024
0 references
0.9133247137069702
0 references
0.8921600580215454
0 references
0.8885654807090759
0 references
0.8838377594947815
0 references
