Approximating weighted matchings in parallel

We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of (1 2 - ) of an NC algorithm for this problem. Keywords. approximation algorithms, parallel algorithms, analysis of algorithms, graph algorithms, maximum weight matching

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Stefan Hougardy, Doratha E. Drake Vinkemeier
• Keywords: Algorithms, Approximation, Approximation Ratio, IPL 2006