Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861)
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: Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm |
scientific article |
Statements
Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (English)
0 references
27 October 2015
0 references
