SIAM Journal on Computing
Randomized algorithms
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Earth Mover's Distance as a Metric for Image Retrieval
International Journal of Computer Vision
Similarity estimation techniques from rounding algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A near-linear constant-factor approximation for euclidean bipartite matching?
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Planar Earthmover is not in L_1
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Matching point sets with respect to the earth mover’s distance
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximation algorithms for computing the earth mover's distance under transformations
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Earth mover distance over high-dimensional spaces
Proceedings of the nineteenth 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
Algorithms and theory of computation handbook
Algorithms for the transportation problem in geometric settings
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A near-linear time ε-approximation algorithm for geometric bipartite matching
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
Proceedings of the twenty-ninth annual symposium on Computational geometry
Moving heaven and earth: distances between distributions
ACM SIGACT News
| Hi-index | 0.00 |
We give an NlogO(1) N-time randomized O(1)-approximation algorithm for computing the cost of minimum bichromatic matching between two planar point-sets of size N.