Beating greedy for stochastic bipartite matching (Q5236367)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7117525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beating greedy for stochastic bipartite matching |
scientific article; zbMATH DE number 7117525 |
Statements
Beating Greedy for Stochastic Bipartite Matching (English)
0 references
15 October 2019
0 references
0.8609750866889954
0 references
0.8594856858253479
0 references
0.8459528684616089
0 references
0.834747314453125
0 references
0.8113713264465332
0 references
