Alignment and Distribution Is Not (Always) NP-Hard.
Vincent BoudetFabrice RastelloYves RobertPublished in: J. Parallel Distributed Comput. (2001)
Keyphrases
- np hard
- special case
- scheduling problem
- optimal solution
- computational complexity
- lower bound
- data mining
- integer programming
- closely related
- probability distribution
- databases
- mobile robot
- image sequences
- constraint satisfaction problems
- website
- probability density function
- approximation algorithms
- minimum cost
- spatial distribution
- normal distribution
- uniformly distributed
- power law
- computationally hard