Approximating weighted matchings in parallel

Information Processing Letters

Volumn 99, Issue 3, 2006, Pages 119-123

  Hougardy, Stefan ^a   Vinkemeier, Doratha E ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Analysis of algorithms; Approximation algorithms; Graph algorithms; Maximum weight matching; Parallel algorithms

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING;

ANALYSIS OF ALGORITHMS; APPROXIMATION ALGORITHMS; GRAPH ALGORITHMS; MAXIMUM WEIGHT MATCHING;

PARALLEL ALGORITHMS;

EID: 33646849073     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.03.005     Document Type: Article

References (13)

1. Drake D.E., and Hougardy S. Improved linear time approximation algorithms for weighted matchings. In: Arora S., Jansen K., Rolim J.D.P., and Sahai A. (Eds). Approximation, Randomization, and Combinatorial Optimization (Approx/Random) 2003. Lecture Notes in Computer Science vol. 2764 (2003), Springer 14-23
2. Drake D.E., and Hougardy S. A linear time approximation algorithm for weighted matchings in graphs. ACM Transactions on Algorithms 1 (2005) 107-122
3. Fischer T., Goldberg A.V., Haglin D.J., and Plotkin S. Approximating matchings in parallel. Information Processing Letters 46 (1993) 115-118
4. Goldberg M., and Spencer T. A new parallel algorithm for the maximal independent set problem. SIAM Journal on Computing 18 2 (1989) 419-427
5. Jájá J. An Introduction to Parallel Algorithms (1992), Addison-Wesley, Reading, MA
6. Karloff H.J. A Las Vegas RNC algorithm for maximum matching. Combinatorica 6 4 (1986) 387-391
7. Karpinski M., and Rytter W. Fast Parallel Algorithms for Graph Matching Problems (1998), Clarendon Press, Oxford
8. Karp R.M., Upfal E., and Wigderson A. Constructing a perfect matching is in random NC. Combinatorica 6 1 (1986) 35-48
9. S. Micali, V.V. Vazirani, An O ( sqrt(V) E ) algorithm for finding maximum matching in general graphs, in: Proc. 21st Annual IEEE Symposium on Foundations of Computer Science, 1980, pp. 17-27
10. Mulmuley K., Vazirani U.V., and Vazirani V.V. Matching is as easy as matrix inversion. Combinatorica 7 1 (1987) 105-113
11. Purdom P.W., and Brown C.A. The Analysis of Algorithms (1985), Holt, Rinehart and Winston, New York
12. Uehara R., and Chen Z.-Z. Parallel approximation algorithms for maximum weighted matching in general graphs. Information Processing Letters 76 1-2 (2000) 13-17
13. Vazirani V.V. A theory of alternating paths and blossoms for proving correctness of the O ( sqrt(V) E ) general graph maximum matching algorithm. Combinatorica 14 1 (1994) 71-109