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

Abstract

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 given problem. Fortunately, the suggested algorithm is a one tackled the matching problem in both Euclidean nonbipartite and bipartite cases. Keywords-Perfect matching; approximation algorithm; MonteCarlo technique; a randomized fully polynomial-time approximation scheme; and randomized algorithm.