Improved linear time approximation algorithms for weighted matchings

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

Volumn 2764, Issue , 2003, Pages 14-23

  Drake, Doratha E ^a   Hougardy, Stefan ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

LINEAR-TIME APPROXIMATION; MATCHINGS; PERFORMANCE RATIO; REAL-WORLD PROBLEM; RUNNING TIME; WEIGHTED GRAPH; WEIGHTED MATCHING;

APPROXIMATION ALGORITHMS;

EID: 21144445205     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_2     Document Type: Article

References (11)

1. D. Avis, A Survey of Heuristics for the Weighted Matching Problem, Networks, Vol. 13 (1983), 475-193
2. R. Beier, J.F. Sibeyn, A Powerful Heuristic for Telephone Gossiping, Proc. 7th Colloquium on Structural Information and Communication Complexity, Carleton Scientific (2000), 17-35
3. D.E. Drake, S. Hougardy, A Simple Approximation Algorithm for the Weighted Matching Problem, Information Processing Letters 85 (2003), 211-213
4. J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, J. Res. Nat. Bur. Standards 69B (1965), 125-130
5. C. Frömmel, C. Gille, A. Goede, C. Gröpl, S. Hougardy, T. Nierhoff, R. Preißner, M. Thimm, Accelerating screening of 3D protein data with a graph theoretical approach, to appear in Bioinformatics
6. H.N. Gabow, An efficient implementation of Edmond's algorithm for maximum matching on graphs, Journal of the ACM 23 (1976), 221-234
7. H.N. Gabow, Data Structures for Weighted Matching and Nearest Common Ancestors with Linking, SODA 1990, 434-443
8. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976
9. R.H. Möhring, M. Müller-Hannemann, Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals, Algorithmica 26 (2000), 148-171
10. B. Monien, R. Preis, R. Diekmann, Quality Matching and Local Improvement for Multilevel Graph-Partitioning, Parallel Computing, 26(12), 2000, 1609-1634
11. R. Preis, Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs, Symposium on Theoretical Aspects of Computer Science, STACS 99, C. Meinel, S. Tison (eds.), Springer, LNCS 1563, 1999, 259-269