![]() |
Volumn 52, Issue 1, 2000, Pages 23-38
|
Note on the computational complexity of least core concepts for min-cost spanning tree games
|
Author keywords
Cooperative game; Least core; NP hard; Nucleolus; Spanning tree
|
Indexed keywords
|
EID: 0037958846
PISSN: 14322994
EISSN: None
Source Type: Journal
DOI: 10.1007/s001860000059 Document Type: Article |
Times cited : (26)
|
References (16)
|