Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane
References (4)
- et al.
The determination of the penmovement of an XY-plotter and its computational complexity
Proc. Spring Conference of the Operations Research Society of Japan
(1980) Combinatorial Optimization—Networks and Matroids
(1976)
There are more references available in the full text version of this article.
Cited by (13)
Matching
1995, Handbooks in Operations Research and Management ScienceHeuristic methods and applications: A categorized survey
1989, European Journal of Operational ResearchOn the existence of weak greedy matching heuristics
1986, Operations Research LettersPractical use of Bucketing Techniques in Computational Geometry
1985, Machine Intelligence and Pattern RecognitionA fast heuristic based on spacefilling curves for minimum-weight matching in the plane
1983, Information Processing LettersRearrangement planning of multiple movable objects by a mobile robot
2009, Advanced Robotics
Copyright © 1981 Published by Elsevier B.V.