A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428)
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: A randomized O(^2k)-competitive algorithm for metric bipartite matching |
scientific article; zbMATH DE number 6375634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching |
scientific article; zbMATH DE number 6375634 |
Statements
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (English)
0 references
2 December 2014
0 references
online algorithm
0 references
competitive analysis
0 references
metric matching
0 references
randomized algorithm
0 references
0.972747802734375
0 references
0.9045037031173706
0 references
0.8884933590888977
0 references
0.8832998871803284
0 references
