The Euclidean degree-4 minimum spanning tree problem is NP-hard.
Andrea FranckeMichael HoffmannPublished in: SCG (2009)
Keyphrases
- np hard
- approximation algorithms
- scheduling problem
- lower bound
- optimal solution
- np complete
- remains np hard
- euclidean space
- computational complexity
- worst case
- special case
- decision problems
- np hardness
- minimum cost
- knapsack problem
- case study
- knowledge base
- constraint satisfaction problems
- computationally challenging
- approximation ratio
- square root
- branch and bound algorithm
- closely related
- search engine
- information systems