Approximation algorithms for the Earth mover's distance under transformations using reference points.
Oliver KleinRemco C. VeltkampPublished in: EuroCG (2005)
Keyphrases
- approximation algorithms
- reference points
- reference point
- np hard
- special case
- minimum cost
- worst case
- facility location problem
- vertex cover
- primal dual
- network design problem
- longest common subsequence
- randomized algorithms
- position and orientation
- critical points
- undirected graph
- precedence constraints
- open shop
- disjoint paths
- combinatorial auctions
- region of interest
- constant factor
- approximation ratio
- constant factor approximation
- image processing
- set cover
- fingerprint images
- upper bound
- multiscale