Computing the nucleolus of min-cost spanning tree games is NP-hard. (Q1972596): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q170461 |
Changed an Item |
||
| Property / author | |||
| Property / author: Walter Kern / rank | |||
Normal rank | |||
Revision as of 09:17, 10 February 2024
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
