Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861)
From MaRDI portal
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
