Computing the nucleolus of min-cost spanning tree games is NP-hard. (Q1972596)
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: Computing the nucleolus of min-cost spanning tree games is NP-hard. |
scientific article; zbMATH DE number 1429822
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the nucleolus of min-cost spanning tree games is NP-hard. |
scientific article; zbMATH DE number 1429822 |
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
