Note Computing the nucleolus of min-cost spanning tree games is NP-hard - Computing the nucleolus of min-cost spanning tree games is NP-hard.
Ulrich FaigleWalter KernJeroen KuipersPublished in: Int. J. Game Theory (1998)
Keyphrases
- spanning tree
- minimum cost
- min cost
- network flow
- np hard
- approximation algorithms
- cooperative game
- max flow
- minimum spanning tree
- minimum weight
- optimal solution
- linear programming
- special case
- lower bound
- scheduling problem
- undirected graph
- solution concepts
- integer programming
- branch and bound algorithm
- knapsack problem
- lagrangian relaxation
- greedy heuristic
- vehicle routing problem
- energy minimization
- combinatorial optimization problems
- constraint satisfaction problems
- objective function