Computing the nucleolus of min-cost spanning tree games is NP-hard. (Q1972596): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:25, 5 March 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