Improved Linear Time Approximation Algorithms for Weighted Matchings-Reference-Cited by-同舟云学术

Improved Linear Time Approximation Algorithms for Weighted Matchings

Published:2003 Issue: Volume: Page:14-23
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
language:
Short-container-title:

Author:

Drake Doratha E.,Hougardy Stefan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-45198-3_2

Reference11 articles.

1. Avis, D.: A Survey of Heuristics for the Weighted Matching Problem. Networks 13, 475–493 (1983)

2. Beier, R., Sibeyn, J.F.: A Powerful Heuristic for Telephone Gossiping. In: Proc. 7th Colloquium on Structural Information and Communication Complexity, pp. 17–35. Carleton Scientific, Ottawa (2000)

3. Drake, D.E., Hougardy, S.: A Simple Approximation Algorithm for the Weighted Matching Problem. Information Processing Letters 85, 211–213 (2003)

4. Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards 69B, 125–130 (1965)

5. Frömmel, C., Gille, C., Goede, A., Gröpl, C., Hougardy, S., Nierhoff, T., Preißner, R., Thimm, M.: Accelerating screening of 3D protein data with a graph theoretical approach. To appear in Bioinformatics

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Heuristic Approach to Improve the Efficiency of Maximum Weight Matching Algorithm Using Clustering;Intelligent Decision Technologies;2022

2. Mining Multi-Objective Minimal Commitment Decision Significance via Cluster-and-Find-Changes;58th AIAA/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference;2017-01-05

3. Linear-Time Approximation for Maximum Weight Matching;Journal of the ACM;2014-01

4. Efficient Parallel and External Matching;Euro-Par 2013 Parallel Processing;2013

5. Near Approximation of Maximum Weight Matching through Efficient Weight Reduction;Lecture Notes in Computer Science;2011