Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861): Difference between revisions
From MaRDI portal
Latest revision as of 22:49, 10 July 2024
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