The complexity of finding fair many-to-one matchings (Q6560813)
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 7870237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding fair many-to-one matchings |
scientific article; zbMATH DE number 7870237 |
Statements
The complexity of finding fair many-to-one matchings (English)
0 references
24 June 2024
0 references
graph theory
0 references
polynomial-time algorithms
0 references
NP-hardness
0 references
FPT
0 references
ILP
0 references
color coding
0 references
submodular and supermodular functions
0 references
algorithmic fairness
0 references
