Approximation Algorithms for Computing the Earth Mover's Distance Under Transformations.
Oliver KleinRemco C. VeltkampPublished in: ISAAC (2005)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- approximation ratio
- worst case
- network design problem
- facility location problem
- distance measure
- primal dual
- minimum cost
- disjoint paths
- np hardness
- constant factor
- combinatorial auctions
- distance function
- approximation guarantees
- open shop
- undirected graph
- set cover
- genetic algorithm
- lower bound
- single machine
- randomized algorithms
- upper bound
- search space