Computing the Fréchet distance with shortcuts is NP-hard.
Maike BuchinAnne DriemelBettina SpeckmannPublished in: CoRR (2013)
Keyphrases
- np hard
- data sets
- special case
- scheduling problem
- face recognition
- lower bound
- approximation algorithms
- np complete
- worst case
- distance measure
- euclidean distance
- optimal solution
- computational complexity
- real world
- computationally challenging
- learning algorithm
- minimum cost
- integer programming
- distance metric
- closely related
- linear programming
- real time
- data mining
- computer vision