U. Faigle
Note on the computational complexity of least core concepts for min-cost spanning tree games
Faigle, U.; Kern, W.; Paulusma, D.
Abstract
Various least core concepts including the classical least core of cooperative games are discussed. By a reduction from minimum cover problems, we prove that computing an element in these least cores is in general NP-hard for minimum cost spanning tree games. As a consequence, computing the nucleolus, the nucleon and the per-capita nucleolus of minimum cost spanning tree games is also NP-hard.
Citation
Faigle, U., Kern, W., & Paulusma, D. (2000). Note on the computational complexity of least core concepts for min-cost spanning tree games. Mathematical Methods of Operations Research, 52(1), 23-38. https://doi.org/10.1007/s001860000059
Journal Article Type | Article |
---|---|
Publication Date | Sep 1, 2000 |
Deposit Date | Oct 13, 2009 |
Publicly Available Date | Jan 8, 2015 |
Journal | Mathematical Methods of Operations Research |
Print ISSN | 1432-2994 |
Electronic ISSN | 1432-5217 |
Publisher | Springer |
Peer Reviewed | Peer Reviewed |
Volume | 52 |
Issue | 1 |
Pages | 23-38 |
DOI | https://doi.org/10.1007/s001860000059 |
Keywords | Cooperative game, Least core, Nucleolus, Spanning tree, NP-hard. |
Public URL | https://durham-repository.worktribe.com/output/1525312 |
Files
Accepted Journal Article
(92 Kb)
PDF
Copyright Statement
The final publication is available at Springer via http://dx.doi.org/10.1007/s001860000059
You might also like
Matching cuts in graphs of high girth and H-free graphs
(2023)
Conference Proceeding
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(2023)
Journal Article
Computing Subset Vertex Covers in H-Free Graphs
(2023)
Conference Proceeding
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
(2023)
Conference Proceeding
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search