Between a rock and a hard place: the two-to-one assignment problem (Q1935948)
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: Between a rock and a hard place: the two-to-one assignment problem |
scientific article; zbMATH DE number 6137612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Between a rock and a hard place: the two-to-one assignment problem |
scientific article; zbMATH DE number 6137612 |
Statements
Between a rock and a hard place: the two-to-one assignment problem (English)
0 references
20 February 2013
0 references
assignment problem
0 references
matching problem
0 references
efficient algorithm
0 references
approximation
0 references
0 references
0 references
0.9926806092262268
0 references
0.7975624203681946
0 references
0.7881032824516296
0 references
0.7863603234291077
0 references
0.7770658731460571
0 references
