Parallel approximation algorithms for maximum weighted matching in general graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1872 LNCS, Issue , 2000, Pages 84-98

  Uehara, Ryuhei ^a   Chen, Zhi Zhong ^b  

^a KOMAZAWA UNIVERSITY   (Japan)

^b TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Graph algorithm; Maximum weighted matching; Parallel algorithm

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; PARALLEL ALGORITHMS; ALGORITHMS;

APPROXIMATION RATIOS; APPROXIMATION SCHEME; EDGE-WEIGHTED GRAPH; GRAPH ALGORITHMS; LARGE AMOUNTS; MAXIMUM DEGREE; MAXIMUM WEIGHTED MATCHING; PARALLEL APPROXIMATION ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84879103905     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44929-9_7     Document Type: Conference Paper

References (15)

1. D. Avis. A Survey of Heuristics for the Weighted Matching Problem. Networks, 13:475-493, 1983.
2. J. Edmonds. Paths, Trees and Flowers. Canad. J. Math., 17:449-467, 1965.
3. T. Fischer, A.V. Goldberg, D.J. Haglin, and S. Plotkin. Approximating matchings in parallel. Information Processing Letters, 46:115-118, 1993.
4. H.N. Gabow. Data Structures for Weighted Matching and Nearest Com-mon Ancestors with Linking. In Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 434-443. ACM, 1990.
5. Z. Galil. Eficient Algorithms for Finding Maximum Matching in Graphs. Computing Surveys, 18(1):23-38, 1986.
6. R. Greenlaw, H.J. Hoover, and W.L. Ruzzo. Limits to Parallel Computa-tion. Oxford University Press, 1995.
7. F. Harary. Graph Theory. Addison-Wesley, 1972.
8. A. Israeli and Y. Shiloach. An Improved Parallel Algorithm for Maximal Matching. Information Processing Letters, 22:57-60, 1986.
9. D.S. Johnson. A Catalog of Complexity Classes. In J. van Leeuwen, editor, The Handbook of Theoretical Computer Science, Vol. I: Algorithms and Complexity, pages 69-161. Elsevier, 1990.
10. R.M. Karp and V. Ramachandran. Parallel Algorithms for Shared-Memory Machines. In J. van Leeuwen, editor, The Handbook of Theoretical Com-puter Science, Vol. I: Algorithms and Complexity, pages 870-941. Elsevier, 1990.
11. M. Karpinski and W. Rytter. Fast Parallel Algorithms for Graph Matching Problems. Clarendon Press, 1998.
12. R.M. Karp, E. Upfal, and A. Wigderson. Constructing a Perfect Matching is in Random NC. Combinatorica, 6(1):35-48, 1986.
13. E.W. Mayr and A. Subramanian. The Complexity of Circuit Value and Network Stability. Journal of Computer and System Science, 44:302-323, 1992.
14. R. Preis. Linear Time 1 2-Approximation Algorithm for MaximumWeighted Matching in General Graphs. In STACS '99, pages 259-269. Lecture Notes in Computer Science Vol. 1563, Springer-Verlag, 1999.
15. S.M. Venkatesan. Approximation Algorithms for Weighted Matching. Theoretical Computer Science, 54:129-137, 1987.