Computing the nucleolus of min-cost spanning tree games is NP-hard. (Q1972596): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s001820050083 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1609615991 / rank | |||
Normal rank | |||
Latest revision as of 01:11, 20 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
