Blossom V: A new implementation of a minimum cost perfect matching algorithm

Mathematical Programming Computation

Volumn 1, Issue 1, 2009, Pages 43-67

  Kolmogorov, Vladimir ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; ALTERNATING TREE; AUXILIARY GRAPH; LINEAR PROGRAMS; MINIMUM COST; PERFECT MATCHINGS; PRIORITY QUEUES; WORST-CASE COMPLEXITY;

ALGORITHMS; TREES (MATHEMATICS);

COSTS;

EID: 77249137177     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-009-0002-8     Document Type: Article

References (28)

1. http://www.cs.ucl.ac.uk/staff/V.Kolmogorov/software.html (Blossom V code, version 1.0)
2. http://www.iwr.uni-heidelberg.de/groups/comopt/software/tsplib95/tsp/
3. http://www.tsp.gatech.edu/vlsi/index.html
4. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
5. Applegate, D., Cook, W.: Solving large-scale matching problems. Network Flows and Matchings. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 12, pp. 557-576 (1993)
6. Ball, M.O., Derigs, U.: An analysis of alternate strategies for implementing matching algorithms. Networks 13, 517-549 (1983)
7. Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM J. Comput. 22(2), 221-242 (1993)
8. Cook, W., Rohe, A.: Computing minimum-weight perfect matchings. INFORMS J. Comput. 11(2), 138-148, (1999). Computer code available at http://www2.isye.gatech.edu/~wcook/blossom4/
9. Derigs, U., Metz, A.: On the use of optimal fractional matchings for solving the (integer) matching problem. Computing 36, 263-270 (1986)
10. Derigs, U., Metz, A.: Solving (large scale) matching problems combinatorially. Math. Program. 50, 113-122 (1991)
11. Edmonds, J.: Maximum matching and a polyhedron with 0-1 vertices. J. Res. Natl. Bur. Stand. 69, 125-130 (1965)
12. Edmonds, J.: Path, trees, and flowers. Can. J. Math. 17, 449-467 (1965)
13. Edmonds, J., Johnson, E.L., Lockhart, S.C.: Blossom I: A Computer Code for the Matching Problem. IBM T. J. Watson Research Center, Yorktown Heights, New York (1969)
14. Fredman, M., Sedgewick, R., Sleator, D., Tarjan, R.: The pairing heap: a new form of self-adjusting heap. Algorithmica 1(1), 111-129 (1986)
15. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM34(3), 596-615 (1987)
16. Gabow, H.: Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs. PhD thesis, Stanford University (1973)
17. Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434-443 (1990)
18. Gabow, H.N., Galil, Z., Spencer, T.H.: Efficient implementation of graph algorithms using contraction. J. ACM 36(3), 540-572 (1989)
19. Gerngross, P.: Zur implementation von edmonds' matching algorithmus: Datenstrukturen und verschiedene varianten. Diplomarbeit, Institut fur Mathematik, Universitat Augsburg (1991)
20. Hochbaum, D.: Instant recognition of half integrality and 2-approximations. In: 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization (1998)
21. Johnson, D.S., McGeoch, C.C.: Network Flows and Matching: First DIMACS Implementation Challenge. American Mathematical Society, Providence (1993). Generators available at ftp://dimacs. rutgers.edu/pub/netflow/generators/matching
22. Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York (1976)
23. Mehlhorn, K., Näher, S.: LEDA: a Platform for Combinatorial and Geometric Computing. Cambridge University Press, New York (1999)
24. Mehlhorn, K., Schäfer, G.: Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures. J. Exp. Algorithmics (JEA) 7, 4 (2002)
25. Moret, B., Shapiro, H.: An empirical analysis of algorithms for constructing a minimum spanning tree. In: 2nd Workshop on Algorithms and Data Structures, pp. 400-411 (1991)
26. Shewchuk, J.R.: Triangle: Engineering a 2D quality mesh generator and delaunay triangulator. In: Applied Computational Geometry: Towards Geometric Engineering. LNCS, vol. 1148, pp. 203-222. Springer, Heideberg (1996). Computer code available at http://www.cs.cmu.edu/quake/triangle.html
27. Shih, W.-K., Wu, S., Kuo, Y.S.: Unifying maximum cut and minimum cut of a planar graph. Trans. Comput. 39(5), 694-697 (1990)
28. Gabow, H., Galil, Z., Micali, S.: An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput. 15, 120-130 (1986)