Touring Disjoint Polygons Problem Is NP-Hard.
Arash AhadiAmirhossein MozafariAlireza ZareiPublished in: COCOA (2013)
Keyphrases
- np hard
- optimal solution
- np complete
- scheduling problem
- special case
- np hardness
- approximation algorithms
- computational complexity
- lower bound
- pairwise
- greedy heuristic
- linear programming
- convex hull
- minkowski sum
- integer programming
- computationally hard
- closely related
- set cover
- geometric objects
- minimum cost
- constraint satisfaction problems
- branch and bound algorithm
- greedy algorithm
- decision problems
- real time
- worst case
- spatial objects
- video sequences
- similarity measure
- clustering algorithm
- data mining
- data sets