Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

IPL
2006

favoriteEmaildiscussreport

151views more IPL 2006»

Approximating weighted matchings in parallel

13 years 4 months ago

Approximating weighted matchings in parallel

Download www.cs.mtu.edu

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

Stefan Hougardy, Doratha E. Drake Vinkemeier

Real-time Traffic

Algorithms | Approximation | Approximation Ratio | IPL 2006 |

claim paper

Related Content

» A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem

» Distributed algorithms for covering packing and maximum weighted matching

» Approximating Spanning Trees with Inner Nodes Cost

» A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

» Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity

» Engineering Algorithms for Approximate Weighted Matching

» Improved Approximation Guarantees for Weighted Matching in the SemiStreaming Model

» Using Google distance to weight approximate ontology matches

» A Windowed Weighted Approach for Approximate Cyclic String Matching

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	IPL
Authors	Stefan Hougardy, Doratha E. Drake Vinkemeier

Comments (0)