论文信息 - A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial scientific computing. Since an exact algorithm for the weighted matching problem is both fairly expensive to compute and hard to parallelise we instead consider fast approximation algorithms. We analyse a distributed algorithm due to Hoepman [8] and show how this can be turned into a parallel algorithm. Through experiments using both complete as well as sparse graphs we show that our new parallel algorithm scales well using up to 32 processors.

Rob H. Bisseling | Fredrik Manne | R. Bisseling | F. Manne

[1] Rob H. Bisseling,et al. Parallel scientific computation - a structured approach using BSP and MPI , 2004 .

[2] Rob H. Bisseling,et al. Parallel Scientific Computation , 2004 .

[3] Stefan Hougardy,et al. A simple approximation algorithm for the weighted matching problem , 2003, Inf. Process. Lett..

[4] David Avis,et al. A survey of heuristics for the weighted matching problem , 1983, Networks.

[5] R. Stephenson. A and V , 1962, The British journal of ophthalmology.

[6] Stefan Hougardy,et al. A linear-time approximation algorithm for weighted matchings in graphs , 2005, TALG.

[7] Peter Sanders,et al. A simpler linear time 2/3-epsilon approximation for maximum weight matching , 2004, Inf. Process. Lett..

[8] P. Sanders,et al. A simpler linear time 2 / 3 − ε approximation for maximum weight matching , 2004 .

[9] Iain S. Duff,et al. On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix , 2000, SIAM J. Matrix Anal. Appl..

[10] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[11] Robert Preis,et al. Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs , 1999, STACS.

[12] Jaap-Henk Hoepman,et al. Simple Distributed Weighted Matchings , 2004, ArXiv.

[13] Iain S. Duff,et al. The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices , 1999, SIAM J. Matrix Anal. Appl..