An Efficient NC Algorithm for Approximate Maximum Weight Matching
暂无分享,去创建一个
We present an alternative implementation of the (1 – ϵ) factor NC approximation algorithm for the maximum weight matching by Hougardy et al. [1]. Our implementation, on the EREW PRAM model of computation, achieves an factor improvement on both the execution time and the number of processors.
[1] David Eppstein,et al. Parallel Algorithmic Techniques for Combinatorial Computation , 1988, ICALP.
[2] Stefan Hougardy,et al. Approximating weighted matchings in parallel , 2006, Inf. Process. Lett..
[3] Zhi-Zhong Chen,et al. Parallel approximation algorithms for maximum weighted matching in general graphs , 2000, Inf. Process. Lett..
[4] Mark K. Goldberg,et al. Constructing a Maximal Independent Set in Parallel , 1989, SIAM J. Discret. Math..