A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

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

2012
*
International Journal of Advanced Computer Science and Applications
*

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 a randomized algorithm which follows a Monte-Carlo method. This algorithm is a randomized fully polynomial-time approximation scheme for the

doi:10.14569/ijacsa.2012.031122
fatcat:26dyn6t5pbgyffycs2ypu4adq4