| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428355 | Information Processing Letters | 2006 | 5 Pages |
Abstract
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 of an NC algorithm for this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
