A parallel approximation algorithm for the weighted maximum matching problem

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

Volumn 4967 LNCS, Issue , 2008, Pages 708-717

  Manne, Fredrik ^a   Bisseling, Rob H ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; NATURAL SCIENCES COMPUTING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; SCHEDULING ALGORITHMS; STATISTICS; TREES (MATHEMATICS);

APPLIED MATHEMATICS; COMBINATORIAL SCIENTIFIC COMPUTING; DISTRIBUTED ALGORITHMS; EDGE MATCHING; EXACT ALGORITHMS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; MAXIMUM MATCHING; PARALLEL PROCESSING; SPARSE GRAPHS; SPRINGER (CO); WEIGHTED MATCHING;

APPROXIMATION ALGORITHMS;

EID: 45449103648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68111-3_74     Document Type: Conference Paper

References (12)

1. Avis, D.: A survey of heuristics for the weighted matching problem. Networks 13, 475-493 (1983)
2. Bisseling, R.H.: Parallel Scientific Computation: A Structured Approach Using BSP and MPI. Oxford University Press, Oxford (2004)
3. Davis, T.: University of Florida sparse matrix collection. NA Digest 92(42) (October 16, 1994), NA Digest 96(28) (July 23, 1996), NA Digest 97(23) (June 7, 1997), http://www.cise.ufl.edu/research/sparse/matrices
4. Drake, D.E., Hougardy, S.: A linear-time approximation algorithm for weighted matchings in graphs. ACM Transactions on Algorithms 1, 107-122 (2005)
5. Duff, I.S., Koster, J.: The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl. 20, 889-901 (1999)
6. Duff, I.S., Koster, J.: On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl. 22, 973-996 (2001)
7. Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison-Wesley, Reading (2003)
8. Hoepman, J.-H.: Simple distributed weighted matchings, arXiv:cs/0410047v1 (2004)
9. Karypis, G., Kumar, V.: Metis, a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. Version 4.0 (1998)
10. Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 1036-1053 (1986)
11. Pettie, S., Sanders, P.: A simpler linear time 2/3 - ε approximation for maximum weight matching. Inf. Process. Lett. 91, 271-276 (2004)
12. Preis, R.: Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 259-269. Springer, Heidelberg (1999)