Note on the computational complexity of least core concepts for min-cost spanning tree games.
Ulrich FaigleWalter KernDaniël PaulusmaPublished in: Math. Methods Oper. Res. (2000)
Keyphrases
- spanning tree
- core concepts
- min cost
- network flow
- minimum cost
- computational complexity
- max flow
- np hard
- machine learning
- database design
- minimum spanning tree
- combinatorial optimization problems
- approximation algorithms
- special case
- undirected graph
- parallel processors
- energy minimization
- worst case
- weighted graph
- metaheuristic
- optimization problems
- scheduling problem
- dynamic programming
- single processor
- convex programming
- optimal solution
- image segmentation