Operations, Information and Decisions Papers

Document Type

Journal Article

Date of this Version

4-1988

Publication Source

Probability in the Engineering and Informational Sciences

Volume

2

Issue

2

Start Page

143

Last Page

156

DOI

10.1017/S0269964800000711

Abstract

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.

Included in

Probability Commons

Share

COinS
 

Date Posted: 27 November 2017

This document has been peer reviewed.