How hard is it to satisfy (almost) all roommates (Q5002706)
From MaRDI portal
scientific article; zbMATH DE number 7375962
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How hard is it to satisfy (almost) all roommates |
scientific article; zbMATH DE number 7375962 |
Statements
28 July 2021
0 references
NP-hard problems
0 references
data reduction rules
0 references
kernelizations
0 references
parameterized complexity
0 references
0 references
How hard is it to satisfy (almost) all roommates (English)
0 references
