Implementing Weighted b-Matching Algorithms: Insights from a Computational Study

ACM Journal of Experimental Algorithmics

Volumn 5, Issue , 2000, Pages 8-

  Müller–Hannemann, Matthias ^a   Schwartz, Alexander ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

b matching; blossom algorithm; operation counting

Indexed keywords

EID: 85017260996     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/351827.384250     Document Type: Article

References (31)

1. Ahuja, R. K., Magnanti, T. L., and Oelin, J. B. 1993. Network Flows. Prentice Hall.
2. Ahuja, R. K. and Oelin, J. B. 1996. Use of representative operation counts in computational testing of algorithms. INFORMS Journal on Computing, 318-330.
3. Anstee, R. P. 1987. A polynomial algorithm for b-matching: An alternative approach. Information Processing Letters 24, 153-157.
4. Applegate, D. and Cook, W. 1993. Solving large-scale matching problems. In D. S. Johnson and C. C. McGeoch Eds., Network Flows and Matching, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 12, pp. 557-576.
5. Avgetidis, I. 1996. Implementation und Vergleich von Lösungsverfahren fiir das maximale, ungewichtete b-Matching Problem. Master's thesis, Technische Universitat Berlin.
6. Ball, M. O. and Deeigs, U. 1983. An analysis of alternative strategies for implementing matching algorithms. Networks 13, 517-549.
7. Cook, W. and Rohe, A. 1997. Computing minimum-weight perfect matchings. Technical Report 97863, Forschungsinstitut fiir Diskrete Mathematik, Universitat Bonn.
8. Deeigs, U. and Metz, A. 1986. On the use of optimal fractional matchings for solving the (integer) matching problem. Computing 36, 263-270.
9. Edmonds, J. 1965b. Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards - B 69B, 125-130.
10. Edmonds, J. 1965b. Paths, trees, and flowers. Can. J. Math. 17, 449-467.
11. Edmonds, J. 1967. An introduction to matching. Lecture notes, University of Michigan, Ann Arbor.
12. Edmonds, J. and Johnson, E. L. 1970. Matching: A well-solved class of integer linear programs. Combinatorial Structures and their Applications, Calgary International Conference, Gordon and Breach, 89-92.
13. Edmonds, J., Johnson, E. L., and Lockhaet, S. C. 1969. Blossom I: a computer code for the matching problem. Unpublished report, IBM T. J. Watson Research Center, Yorktown Heights, New York.
14. Feedman, M. L. 1999. On the efflciency of pairing heaps and related data structures. Journal of the ACM 46, 473-501.
15. Feedman, M. L., Sedgewick, R., Sleatoe, D. D., and Taejan, R. E. 1986. The pairing heap: a new form of self-adjusting heap. Algorithmica 1, 111-129.
16. Feedman, M. L. and Taejan, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34, 596-615.
17. Gabow, H. N. 1983. An efflcient reduction technique for degree-constrained subgraph and bidirected network flow problems. Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, 448-456.
18. Geeaeds, A. M. H. 1995. Matching. Volume 7 of Handbooks in Operations Research and Management Science, Chapter 3, pp. 135-224. North-Holland.
19. Geotschel, M. and Holland, O. 1985. Solving matching problems with linear programming. Math. Prog. 33, 243-259.
20. Maesh III, A. B. 1979. Matching algorithms. Ph. D. thesis, The John Hopkins University, Baltimore.
21. Millee, D. L. 1995. A matching based exact algorithm for capacitated vehicle routing problems. ORSA J. of Computing 7, 1-9.
22. Miller, D. L. and Pekny, J. F. 1995. A staged primal-dual algorithm for perfect b-matching with edge capacities. ORSA J. of Computing 7, 298-320.
23. Möheing, R. H. and Müller-Hannemann, M. 2000. Complexity and modeling aspects of mesh reflnement into quadrilaterals. Algorithmica 26, 148-171.
24. An extended abstract appeared in Proceedings of the 8th Annual International Symposium on Algorithms and Computation, ISAAC’97, Singapore, Lecture Notes in Computer Science 1350, Springer-Verlag, pp. 263-273.
25. Möhring, R. H., Müller-Hannemann, M., and Weihe, K. 1997. Mesh reflnement via bidirected flows: Modeling, complexity, and computational results. Journal of the ACM 44, 395-426.
26. Müller-Hannemann, M. and Schwartz, A. 1999. Implementing weighted b-matching algorithms: Towards a flexible software design. ACM Journal of Experimental Algorithmics 4, Article 7.
27. Oelin, J. B. 1988. A faster strongly polynomial minimum cost flow algorithm. Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 377-387.
28. Padberg, M. and Rao, M. R. 1982. Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7, 67-80.
29. Pulleyblank, W. R. 1973. Faces of matching polyhedra. Ph. D. thesis. Faculty of Mathematics, University of Waterloo.
30. Pulleyblank, W. R. 1995. Matchings and extensions. Volume 1 of Handbook of Combinatorics, Chapter 3, pp. 179-232. North-Holland.
31. Stasko, J. T. and Vitter, J. S. 1987. Pairing heaps: experiments and analysis. Communications of the ACM 30, 234-249.