Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources (Q788636)
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: Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources |
scientific article; zbMATH DE number 3843501
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources |
scientific article; zbMATH DE number 3843501 |
Statements
Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources (English)
0 references
1983
0 references
NP-hardness
0 references
housing market management
0 references
computational complexity
0 references
combinatorial programming
0 references
optimal set of exchange alternatives
0 references
indivisible resources
0 references
vertex covering of a graph
0 references
