Abstract
We present an experimental study of an implementation of weighted perfect b-matching based on Pulleyblank’s algorithm (1973). Although this problem is well-understood in theory and efficient algorithms are known, only little experience with implementations is available. In this paper several algorithmic variants are compared on synthetic and application problem data of very sparse graphs. This study was motivated by the practical need for an efficient b-matching solver for the latter application, namely as a subroutine in our approach to a mesh refinement problem in computer-aided design (CAD).
Linear regression and operation counting is used to analyze code variants. The experiments indicate that a fractional jump-start should be used, a priority queue within the dual update helps, scaling of b-values is not necessary, whereas a delayed blossom shrinking heuristic significantly improves running times only for graphs with average degree two. The fastest variant of our implementation appears to be highly superior to a code by (1995).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Applegate and W. Cook, Solving large-scale matching problems, Network Flows and Matching, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (D. S. Johnson and C. C. McGeoch, eds.), vol. 12, 1993, pp. 557–576.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows, Prentice Hall, 1993.
R. P. Anstee, A polynomial algorithm for b-matching: An alternative approach, Information Processing Letters 24 (1987), 153–157.
R. K. Ahuja and J. B. Orlin, Use of representative operation counts in computational testing of algorithms, INFORMS Journal on Computing (1996), 318–330.
I. Avgetidis, Implementation und Vergleich von Lösungsverfahren für das maximale, ungewichtete b-Matching Problem, Diploma thesis, Technische Universität Berlin, 1996.
M. O. Ball and U. Derigs, An analysis of alternative strategies for implementing matching algorithms, Networks 13 (1983), 517–549.
W. Cook and A. Rohe, Computing minimum-weight perfect matchings, Tech. Report 97863, Forschungsinstitut für Diskrete Mathematik, Universität Bonn, 1997.
U. Derigs and A. Metz, On the use of optimal fractional matchings for solving the (integer) matching problem, Computing 36 (1986), 263–270.
J. Edmonds, Paths, trees, and flowers, Can. J. Math. 17 (1965), 449–467.
J. Edmonds and E. L. Johnson, Matching: A well-solved class of integer linear programs, Combinatorial Structures and their Applications, Calgary International Conference, Gordon and Breach (1970), 89–92.
J. Edmonds, E. L. Johnson, and S. C. Lockhart, Blossom I: a computer code for the matching problem, unpublished report, IBM T. J. Watson Research Center, Yorktown Heights, New York, 1969.
H. N. Gabow, 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 (1983), 448–456.
A. M. H. Gerards, Matching, Handbooks in Operations Research and Management Science, vol. 7, North-Holland, 1995, pp. 135–224.
M. Grötschel and O. Holland, Solving matching problems with linear programming, Math. Prog. 33 (1985), 243–259.
A. B. Marsh III, Matching algorithms, Ph.D. thesis, The John Hopkins University, Baltimore, 1979.
D. L. Miller, A matching based exact algorithm for capacitated vehicle routing problems, ORSA J. of Computing (1995), 1–9.
R. H. Möhring and M. Müller-Hannemann, Complexity and modeling aspects of mesh refinement into quadrilaterals, Proceedings of the 8th Annual International Symposium on Algorithms and Computation, ISAAC’97, Singapore, Lecture Notes in Computer Science 1350, Springer-Verlag, 1997, pp. 263–273.
R. H. Möhring, M. Müller-Hannemann, and K. Weihe, Mesh refinement via bidirected flows: Modeling, complexity, and computational results, Journal of the ACM 44 (1997), 395–426.
D. L. Miller and J. F. Pekny, A staged primal-dual algorithm for perfect b-matching with edge capacities, ORSA J. of Computing 7 (1995), 298–320.
M. Müller-Hannemann and A. Schwartz, Implementing weighted b-matching. algorithms: Towards a flexible software design, Technical report No. 591/1998, Fachbereich Mathematik, Technische Universität Berlin, 1998, an extended abstract appeared in Proceedings of 2nd Workshop on Algorithm Engineering, K. Mehlhorn (Ed.), 1998, pages 86–97, http://www.mpi-sb.mpg.de/~wae98/PROCEEDINGS/.
J. B. Orlin, A faster strongly polynomial minimum cost flow algorithm, Proceedings of the 20th Annual ACM Symposium on Theory of Computing (1988), 377–387.
M. Padberg and M. R. Rao, Odd minimum cut-sets and b-matchings, Math. Oper. Res. 7 (1982), 67–80.
W. R. Pulleyblank, Faces of matching polyhedra, Ph.D. thesis, Faculty of Mathematics, University of Waterloo, 1973.
W. R. Pulleyblank, Matchings and extensions, Handbook of Combinatorics, vol. 1, North-Holland, 1995, pp. 179–232.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Müller-Hannemann, M., Schwartz, A. (1999). Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. In: Goodrich, M.T., McGeoch, C.C. (eds) Algorithm Engineering and Experimentation. ALENEX 1999. Lecture Notes in Computer Science, vol 1619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48518-X_2
Download citation
DOI: https://doi.org/10.1007/3-540-48518-X_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66227-3
Online ISBN: 978-3-540-48518-6
eBook Packages: Springer Book Archive