A simpler linear time 2/3 - ε approximation for maximum weight matching

Information Processing Letters

Volumn 91, Issue 6, 2004, Pages 271-276

  Pettie, Seth ^a   Sanders, Peter ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Analysis of algorithms; Approximation; Matching; Maximum weight matching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING; VLSI CIRCUITS;

DRAKE-HOUGARDY APPROACH; FINITE ELEMENT MESHES; MAXIMUM WEIGHT MATCHING (MWM);

DATA PROCESSING;

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

References (8)

1. Drake D., Hougardy S. Improved linear time approximation algorithms for weighted matchings. 7th International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX). Lecture Notes in Comput. Sci. vol. 2764:2003;14-23 Springer-Verlag, Berlin.
2. Drake D., Hougardy S. Linear time local improvements for weighted matchings in graphs. International Workshop on Experimental and Efficient Algorithms (WEA). Lecture Notes in Comput. Sci. vol. 2647:2003;107-119 Springer-Verlag, Berlin.
3. Drake D., Hougardy S. A simple approximation algorithm for the weighted matching problem. Inform. Process. Lett. 85:2003;211-213.
4. Gabow H.N. Data structures for weighted matching and nearest common ancestors with linking. First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1990;434-443.
5. Gabow H.N., Tarjan R.E. Faster scaling algorithms for network problems. SIAM J. Comput. 18:(5):1989;1013-1036.
6. Gabow H.N., Tarjan R.E. Faster scaling algorithms for general graph-matching problems. J. ACM. 38:(4):1991;815-853.
7. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2:1973;225-231.
8. Preis R. Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs. Proc. 16th Ann. Symp. on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Comput. Sci. vol. 1563:1999;259-269 Springer-Verlag, Berlin.