Date of this Version
Probability in the Engineering and Informational Sciences
Given a collection of n points in the plane, the Euclidean matching problem is the task of decomposing the collection into matched pairs connected by line segments in such a way as to minimize the sum of all the segment lengths. The greedy heuristic provides an approximate solution to the Euclidean matching problem by successively matching the two closest unmatched points. We study the behavior of Gn, the sum of the lengths of the segments produced by the greedy heuristic.
Avis, D., Davis, B., & Steele, J. M. (1988). Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching. Probability in the Engineering and Informational Sciences, 2 (2), 143-156. http://dx.doi.org/10.1017/S0269964800000711
Date Posted: 27 November 2017
This document has been peer reviewed.