Computing the nucleolus of min-cost spanning tree games is NP-hard. (Q1972596)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the nucleolus of min-cost spanning tree games is NP-hard. |
scientific article |
Statements
Computing the nucleolus of min-cost spanning tree games is NP-hard. (English)
0 references
11 April 2000
0 references
\(N\) -person game
0 references
