The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Digital Archiving Policy
  • Promote your Publication
  • Metadata Harvesting (OAI2)

IJACSA

  • About the Journal
  • Call for Papers
  • Editorial Board
  • Author Guidelines
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Fees/ APC
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving

Special Issues

  • Home
  • Archives
  • Proposals
  • Guest Editors
  • SUSAI-EE 2025
  • ICONS-BA 2025
  • IoT-BLOCK 2025

Future of Information and Communication Conference (FICC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Computing Conference

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Call for Papers
  • Editorial Board
  • Guidelines
  • Submit
  • Current Issue
  • Archives
  • Indexing
  • Fees
  • Reviewers
  • Subscribe

DOI: 10.14569/IJACSA.2012.031122
PDF

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

Author 1: Yasser M. Abd El-Latif
Author 2: Salwa M. Ali
Author 3: Hanaa A.E. Essa
Author 4: Soheir M. Khamis

International Journal of Advanced Computer Science and Applications(IJACSA), Volume 3 Issue 11, 2012.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

Abstract: In the approximate Euclidean min-weighted perfect matching problem, a set of points in the plane and a real number are given. Usually, a solution of this problem is a partition of points of into pairs such that the sum of the distances between the paired points is at most 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 given problem. Fortunately, the suggested algorithm is a one tackled the matching problem in both Euclidean nonbipartite and bipartite cases. The presented algorithm outlines as follows: With repeating times, we choose a point from to build the suitable pair satisfying the suggested condition on the distance. If this condition is achieved, then remove the points of the constructed pair from and put this pair in (the output set of the solution). Then, choose a point and the nearest point of it from the remaining points in to construct a pair and put it in . Remove the two points of the constructed pair from and repeat this process until becomes an empty set. Obviously, this method is very simple. Furthermore, our algorithm can be applied without any modification on complete weighted graphs and complete weighted bipartite graphs , where and m is an even.

Keywords: Perfect matching; approximation algorithm; Monte-Carlo technique; a randomized fully polynomial-time approximation scheme; and randomized algorithm.

Yasser M. Abd El-Latif, Salwa M. Ali, Hanaa A.E. Essa and Soheir M. Khamis, “A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane” International Journal of Advanced Computer Science and Applications(IJACSA), 3(11), 2012. http://dx.doi.org/10.14569/IJACSA.2012.031122

@article{El-Latif2012,
title = {A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2012.031122},
url = {http://dx.doi.org/10.14569/IJACSA.2012.031122},
year = {2012},
publisher = {The Science and Information Organization},
volume = {3},
number = {11},
author = {Yasser M. Abd El-Latif and Salwa M. Ali and Hanaa A.E. Essa and Soheir M. Khamis}
}



Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

IJACSA

Upcoming Conferences

IntelliSys 2025

28-29 August 2025

  • Amsterdam, The Netherlands

Future Technologies Conference 2025

6-7 November 2025

  • Munich, Germany

Healthcare Conference 2026

21-22 May 2026

  • Amsterdam, The Netherlands

Computing Conference 2026

9-10 July 2026

  • London, United Kingdom

IntelliSys 2026

3-4 September 2026

  • Amsterdam, The Netherlands

Computer Vision Conference 2026

15-16 October 2026

  • Berlin, Germany
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Paper
  • Indexing

Our Conferences

  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference
  • Communication Conference

Help & Support

  • Contact Us
  • About Us
  • Terms and Conditions
  • Privacy Policy

© The Science and Information (SAI) Organization Limited. All rights reserved. Registered in England and Wales. Company Number 8933205. thesai.org