An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (Q2118096)
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: An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint |
scientific article |
Statements
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint (English)
0 references
22 March 2022
0 references
submodular function maximization
0 references
approximation algorithms
0 references
contention resolution schemes
0 references
0 references
0 references
0 references
0 references
0 references
0.8156999349594116
0 references
0.8141376972198486
0 references
0.7753159403800964
0 references
0.749015212059021
0 references
0.7322428822517395
0 references
