A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
- 28 May 2008
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A linear-time approximation algorithm for weighted matchings in graphsACM Transactions on Algorithms, 2005
- A simpler linear time 2/3−ε approximation for maximum weight matchingInformation Processing Letters, 2004
- Parallel Scientific ComputationPublished by Oxford University Press (OUP) ,2004
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse MatrixSIAM Journal on Matrix Analysis and Applications, 2001
- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General GraphsLecture Notes in Computer Science, 1999
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse MatricesSIAM Journal on Matrix Analysis and Applications, 1999
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- A survey of heuristics for the weighted matching problemNetworks, 1983