A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Files
Publication date
2008
Authors
Bisseling, R.H.
Manne, F.
Editors
Wyrzykowski, Roman
Advisors
Supervisors
Document Type
Part of book
Metadata
Show full item recordCollections
License
Abstract
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 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.",
Keywords
Wiskunde en Informatica (WIIN), Mathematics, Wiskunde en computerwetenschappen, Landbouwwetenschappen, Wiskunde: algemeen, Taverne
Citation
Bisseling, R H & Manne, F 2008, A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem. in R Wyrzykowski (ed.), Proceedings Seventh International Conference on Parallel Processing and Applied Mathematics (PPAM 2007. Lecture Notes in Computer Science, vol. 4967, Springer, pp. 708-717. https://doi.org/10.1007/978-3-540-68111-3_74