A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane


In the approximate Euclidean min-weighted perfect matching problem, a set V of n 2 points in the plane and a real number 0   are given. Usually, a solution of this problem is a partition of points of V into n pairs such that the sum of the distances between the paired points is at most ) 1 (   times the optimal solution. In this paper, the authors give… (More)

2 Figures and Tables


  • Presentations referencing similar topics