Faster scaling algorithms for network problems
SIAM Journal on Computing
SIAM Journal on Computing
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Online Segmentation of Freehand Stroke by Dynamic Programming
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
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
Earth mover distance over high-dimensional spaces
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The pyramid match: efficient learning with partial correspondences
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Efficiently searching for similar images
Communications of the ACM
Light reallocation for high contrast projection using an analog micromirror array
ACM SIGGRAPH Asia 2010 papers
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
Gestures as point clouds: a $P recognizer for user interface prototypes
Proceedings of the 14th ACM international conference on Multimodal interaction
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.02 |
In the Euclidean bipartite matching problem, we are given a set R of "red" points and a set B of "blue" points in ℝ3 where |R| = |B| = n, and we want to pair up each red point with a distinct blue point so that the sum of distances between the paired points is minimized. We present an approximation algorithm that given any parameter 0 ε O(n1+ε) expected time and returns a matching whose expected cost is within a multiplicative factor O(log (1/ε)) of the optimal. The dimension d is considered to be a fixed constant.