A near linear time constant factor approximation for Euclidean bichromatic matching (cost)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Overcoming the l1 non-embeddability barrier: algorithms for product metrics
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
| Hi-index | 0.00 |
We show that any L_1 embedding of the transportation cost (a.k.a. Earthmover) metric on probability measures supported on the grid {0, 1, . . ., n}^2 \subseteq\mathbb{R}^2incurs distortion \Omega(\sqrt {\log n}). We also use Fourier analytic techniques to construct a simple L_1 embedding of this space which has distortion O(log n).