A \((1 + 1/e)\)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists (Q5236366)
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: A (1 + 1/e)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists |
scientific article; zbMATH DE number 7117524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \((1 + 1/e)\)-approximation algorithm for maximum stable matching with one-sided ties and incomplete lists |
scientific article; zbMATH DE number 7117524 |
Statements
A (1 + 1/<i>e</i>)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete Lists (English)
0 references
15 October 2019
0 references
0.9121838212013244
0 references
0.9087975025177002
0 references
0.9080085754394532
0 references
0.905404269695282
0 references
0.903009831905365
0 references
