Computing the Fréchet distance with shortcuts is NP-hard.
Maike BuchinAnne DriemelBettina SpeckmannPublished in: SoCG (2014)
Keyphrases
- np hard
- distance measure
- np complete
- lower bound
- approximation algorithms
- computational complexity
- neural network
- optimal solution
- euclidean distance
- distance function
- remains np hard
- databases
- distance matrix
- minimum cost
- knapsack problem
- linear programming
- upper bound
- scheduling problem
- special case
- website
- information systems