Linear time local improvements for weighted matchings in graphs

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

Volumn 2647, Issue , 2003, Pages 107-119

  Drake, Doratha E ^a   Hougardy, Stefan ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPHIC METHODS;

EXPERIMENTAL COMPARISON; GREEDY ALGORITHMS; LINEAR TIME; LINEAR-TIME APPROXIMATION; MATCHINGS IN GRAPHS; PERFORMANCE RATIO; WEIGHTED GRAPH; WEIGHTED MATCHING;

ALGORITHMS;

EID: 21144431651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44867-5_9     Document Type: Article

References (18)

1. D. Avis, A Survey of Heuristics for the Weighted Matching Problem, Networks, Vol. 13 (1983), 475-493
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. B. Chandra, M. M. Halldórsson, Greedy local improvement and weighted set packing approximation, Journal of Algorithms, 39 (2000), 223-240
4. W. Cook, A. Rohe, Computing minimum-weight perfect matchings, INFORMS Journal on Computing 11 (1999), 138-148
5. D. E. Drake, S. Hougardy, A Simple Approximation Algorithm for the Weighted Matching Problem, Information Processing Letters 85 (2003), 211-213
6. C. Frömmel, A. Goede, C. Gröpl, S. Hougardy, T. Nierhoff, R. Preissner, M. Thimm, Accelerating screening of 3D protein data with a graph theoretical approach, Humboldt-Universität zu Berlin, September 2002
7. H. N. Gabow, Data Structures for Weighted Matching and Nearest Common Ancestors with Linking, SODA 1990, 434-443
8. H. N. Gabow, R. E. Tarjan, Faster Scaling Algorithms for General Graph-Matching Problems, JACM 38 (1991), 815-853
9. G. Goldfarb, M. D. Grigoriadis, A Computational Comparison of the Dinic and Network Simplex Methods for Maximum Flow, Annals of Operations Research 13 (1988), 83-123
10. M. M. Halldórsson, Approximating Discrete Collections via Local Improvements, In Proc. of Sixth SIAM/ACM Symposium on Discrete Algorithms, San Francisco (1995), 160-169
11. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM Journal on Computing 2 (1973), 225-231
12. J. Magun, Greedy Matching Algorithms, an Experimental Study, ACM Journal of Experimental Algorithms, Volume 3, Article 6, 1998
13. K. Mehlhorn, S. Näher, LEDA: A Platform for Combinatorial and Geometric Computing, ACM Press (1995), New York, NY
14. S. Micali and V. V. Vazirani, An O(√VE) Algorithm for Finding Maximum Matching in General Graphs, Proc. 21st Annual IEEE Symposium on Foundations of Computer Science (1980), 17-27
15. R. H. Möhring, M. Müller-Hannemann, Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals, Algorithmica 26 (2000), 148-171
16. B. Monien , R. Preis , R. Diekmann, Quality Matching and Local Improvement for Multilevel Graph-Partitioning, Parallel Computing, 26(12), 2000, 1609-1634
17. 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
18. V. V. Vazirani, A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(√VE) Maximum Matching Algorithm, Combinatorica 14:1 (1994), 71-109