md-MST is NP-hard for d>=3.
Ana Maria de AlmeidaPedro MartinsMaurício C. de SouzaPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- np hard
- minimum spanning tree
- minimal spanning tree
- scheduling problem
- lower bound
- special case
- np complete
- optimal solution
- approximation algorithms
- decision problems
- integer programming
- np hardness
- closely related
- linear programming
- remains np hard
- branch and bound algorithm
- computationally challenging
- computational complexity
- minimum cost
- worst case
- greedy heuristic
- constraint satisfaction problems
- set cover
- spanning tree
- databases
- upper bound
- probabilistic model
- dynamic programming
- hidden markov models
- randomly generated problem instances
- search engine