Implementing Weighted 6-Matching Algorithms: Towards a Flexible Software Design

ACM Journal of Experimental Algorithmics

Volumn 4, Issue , 1999, Pages 7-

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

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

6 matching; algorithms; blossom algorithm; design patterns; experimentation; object oriented design; Software design

Indexed keywords

EID: 82955238830     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/347792.347815     Document Type: Article

References (35)

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. American National Standards Institute. 1998. Programming Languages - C++. American National Standards Institute. International Standard ISO/IEC 14882, New York.
4. Anstee, R. P. 1987. A polynomial algorithm for 6-matching: An alternative approach. Information Processing Letters 24, 153-157.
5. 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.
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 für Diskrete Mathematik, Universität Bonn.
8. Derigs, 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. 1965a. 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. Gabow, H. N. 1983. An efficient 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.
15. Gamma, E., Helm, R., Johnson, R., and Vlissides, J. 1995. Design patterns: Elements of reusable Object-Oriented Software. Addison-Wesley.
16. Gerards, A. M. H. 1995. Matching. Volume 7 of Handbooks in Operations Research and Management Science, Chapter 3, pp. 135-224. North-Holland.
17. Geötschel, M. and Holland, O. 1985. Solving matching problems with linear programming. Math. Prog. 33, 243-259.
18. Kühl, D., Nissen, M., and Weihe, K. 1997. Efficient, adaptable implementations of graph algorithms. In Workshop on Algorithm Engineering (WAE’97). http://www.dsi.unive.it/” wae97/proceedings.
19. Kühl, D. and Weihe, K. 1996. Iterators and handles for nodes and edges in graphs. Konstanzer Schriften in Mathematik und Informatik Nr. 15, Universitat Konstanz. http://www.informatik.uni-konstanz.de/” weihe/manuscripts.html#paper24.
20. Kühl, D. and Weihe, K. 1997. Data access templates. C++-Report 9, 7, pp. 15 and 18-21.
21. Lovász, L. and Plummer, M. D. 1986. Matching Theory, Volume 29 of Annals of Discrete Mathematics. North-Holland.
22. Marsh III, A. B. 1979. Matching algorithms. Ph. D. thesis, The John Hopkins University, Baltimore.
23. Miller, D. L. 1995. A matching based exact algorithm for capacitated vehicle routing problems. ORSA J. of Computing 7, 1-9.
24. Miller, D. L. and Pekny, J. F. 1995. A staged primal-dual algorithm for perfect 6-matching with edge capacities. ORSA J. of Computing 7, 298-320.
25. Möhring, R. H. and Müllee-Hannemann, M. 1995. Cardinality matching: Heuristic search for augmenting paths. Technical report No. 439/1995, Fachbereich Mathematik, Technische Universitat Berlin. ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-439-1995.PS.Z.
26. Möhring, R. H. and Müllee-Hannemann, M. 2000. Complexity and modeling aspects of mesh reflnement into quadrilaterals. Algorithmica 26, 148-171. 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.
27. Möhring, R. H., Müllee-Hannemann, M., and Weihe, K. 1997. Mesh reflnement via bidirected flows: Modeling, complexity, and computational results. Journal of the ACM 44, 395-426.
28. Müller-hannemann, M. 1997. High quality quadrilateral surface meshing without template restrictions: A new approach based on network flow techniques. In Proceedings of the 6th International Meshing Roundtable, Park City, Utah, pp. 293-307, also to appear in the International Journal of Computational Geometry and Applications (IJCGA). Sandia National Laboratories, Albuquerque, USA.
29. Müller-hannemann, M. and Schwaetz, A. 1999. Implementing weighted b-matching algorithms: Insights from a computational study. In Proceedings of the Workshop on Algorithm Engineering and Experimentation (ALENEX’99), Volume 1619 of Lecture Notes in Computer Science, pp. 18-36. Springer.
30. Orlin, J. B. 1988. A faster strongly polynomial minimum cost flow algorithm. Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 377-387.
31. Padberg, M. and Rao, M. R. 1982. Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7, 67-80.
32. Pulleyblank, W. R. 1973. Faces of matching polyhedra. Ph. D. thesis. Faculty of Mathematics, University of Waterloo.
33. Pulleyblank, W. R. 1995. Matchings and extensions. Volume 1 of Handbook of Combinatorics, Chapter 3, pp. 179-232. North-Holland.
34. Reinelt, G. 1991. Tsplib - a traveling salesman problem library. ORSA Journal on Computing 3, 376-384. See also http://elib.zib.de/pub/mp-testdata/tsp/index.html.
35. Weihe, K. 1998. A software engineering perspective on algorithms. Konstanzer Schriften in Mathematik und Informatik Nr. 50, Universitat Konstanz, ftp://ftp.informatik.uni-konstanz.de/pub/preprints/1998/preprint-050.ps.Z.