Online bipartite matching with amortized \(O(\log^2 n)\) replacements (Q5215466)
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: Online bipartite matching with amortized O(^2 n) replacements |
scientific article; zbMATH DE number 7165889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online bipartite matching with amortized \(O(\log^2 n)\) replacements |
scientific article; zbMATH DE number 7165889 |
Statements
Online Bipartite Matching with Amortized <i>O</i> (log <sup>2</sup> <i>n</i> ) Replacements (English)
0 references
11 February 2020
0 references
online algorithms
0 references
bipartite graphs
0 references
load balancing
0 references
maximum matching
0 references
shortest augmenting path
0 references
0.9962252974510192
0 references
0.7959184646606445
0 references
0.795088529586792
0 references
0.7908144593238831
0 references
