{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:30:00Z","timestamp":1649043000722},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662273","type":"print"},{"value":"9783540485186","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48518-x_2","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T18:57:15Z","timestamp":1195066635000},"page":"18-36","source":"Crossref","is-referenced-by-count":6,"title":["Implementing Weighted b-Matching Algorithms: Insights from a Computational Study"],"prefix":"10.1007","author":[{"given":"Matthias","family":"M\u00fcller-Hannemann","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Schwartz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013576.","DOI":"10.1090\/dimacs\/012\/22"},{"key":"2_CR2","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network flows, Prentice Hall, 1993."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(87)90178-5","volume":"24","author":"R. P. Anstee","year":"1987","unstructured":"R. P. Anstee, A polynomial algorithm for b-matching: An alternative approach, Information Processing Letters 24 (1987), 153\u2013157.","journal-title":"Information Processing Letters"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"R. K. Ahuja and J. B. Orlin, Use of representative operation counts in computational testing of algorithms, INFORMS Journal on Computing (1996), 318\u2013330.","DOI":"10.1287\/ijoc.8.3.318"},{"key":"2_CR5","unstructured":"I. Avgetidis, Implementation und Vergleich von L\u00f6sungsverfahren f\u00fcr das maximale, ungewichtete b-Matching Problem, Diploma thesis, Technische Universit\u00e4t Berlin, 1996."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1002\/net.3230130406","volume":"13","author":"M. O. Ball","year":"1983","unstructured":"M. O. Ball and U. Derigs, An analysis of alternative strategies for implementing matching algorithms, Networks 13 (1983), 517\u2013549.","journal-title":"Networks"},{"key":"2_CR7","unstructured":"W. Cook and A. Rohe, Computing minimum-weight perfect matchings, Tech. Report 97863, Forschungsinstitut f\u00fcr Diskrete Mathematik, Universit\u00e4t Bonn, 1997."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02240072","volume":"36","author":"U. Derigs","year":"1986","unstructured":"U. Derigs and A. Metz, On the use of optimal fractional matchings for solving the (integer) matching problem, Computing 36 (1986), 263\u2013270.","journal-title":"Computing"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Paths, trees, and flowers, Can. J. Math. 17 (1965), 449\u2013467.","journal-title":"Can. J. Math."},{"key":"2_CR10","unstructured":"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\u201392."},{"key":"2_CR11","unstructured":"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."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013456.","DOI":"10.1145\/800061.808776"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0927-0507(05)80120-3","volume":"7","author":"A. M. H. Gerards","year":"1995","unstructured":"A. M. H. Gerards, Matching, Handbooks in Operations Research and Management Science, vol. 7, North-Holland, 1995, pp. 135\u2013224.","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01584376","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel and O. Holland, Solving matching problems with linear programming, Math. Prog. 33 (1985), 243\u2013259.","journal-title":"Math. Prog."},{"key":"2_CR15","volume-title":"Matching algorithms","author":"A. B. Marsh III","year":"1979","unstructured":"A. B. Marsh III, Matching algorithms, Ph.D. thesis, The John Hopkins University, Baltimore, 1979."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"D. L. Miller, A matching based exact algorithm for capacitated vehicle routing problems, ORSA J. of Computing (1995), 1\u20139.","DOI":"10.1287\/ijoc.7.1.1"},{"key":"2_CR17","first-page":"263","volume":"1350","author":"R. H. M\u00f6hring","year":"1997","unstructured":"R. H. M\u00f6hring and M. M\u00fcller-Hannemann, Complexity and modeling aspects of mesh refinement into quadrilaterals, Proceedings of the 8th Annual International Symposium on Algorithms and Computation, ISAAC\u201997, Singapore, Lecture Notes in Computer Science 1350, Springer-Verlag, 1997, pp. 263\u2013273.","journal-title":"Proceedings of the 8th Annual International Symposium on Algorithms and Computation, ISAAC\u201997, Singapore, Lecture Notes in Computer Science"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/258128.258174","volume":"44","author":"R. H. M\u00f6hring","year":"1997","unstructured":"R. H. M\u00f6hring, M. M\u00fcller-Hannemann, and K. Weihe, Mesh refinement via bidirected flows: Modeling, complexity, and computational results, Journal of the ACM 44 (1997), 395\u2013426.","journal-title":"Journal of the ACM"},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/ijoc.7.3.298","volume":"7","author":"D. L. Miller","year":"1995","unstructured":"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\u2013320.","journal-title":"ORSA J. of Computing"},{"key":"2_CR20","unstructured":"M. M\u00fcller-Hannemann and A. Schwartz, Implementing weighted b-matching. algorithms: Towards a flexible software design, Technical report No. 591\/1998, Fachbereich Mathematik, Technische Universit\u00e4t Berlin, 1998, an extended abstract appeared in Proceedings of 2nd Workshop on Algorithm Engineering, K. Mehlhorn (Ed.), 1998, pages 86\u201397, http:\/\/www.mpi-sb.mpg.de\/~wae98\/PROCEEDINGS\/ ."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"J. B. Orlin, A faster strongly polynomial minimum cost flow algorithm, Proceedings of the 20th Annual ACM Symposium on Theory of Computing (1988), 377\u2013387.","DOI":"10.21236\/ADA457044"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M. Padberg","year":"1982","unstructured":"M. Padberg and M. R. Rao, Odd minimum cut-sets and b-matchings, Math. Oper. Res. 7 (1982), 67\u201380.","journal-title":"Math. Oper. Res."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"W. R. Pulleyblank, Faces of matching polyhedra, Ph.D. thesis, Faculty of Mathematics, University of Waterloo, 1973.","DOI":"10.1007\/BFb0066196"},{"key":"2_CR24","first-page":"179","volume":"1","author":"W. R. Pulleyblank","year":"1995","unstructured":"W. R. Pulleyblank, Matchings and extensions, Handbook of Combinatorics, vol. 1, North-Holland, 1995, pp. 179\u2013232.","journal-title":"Handbook of Combinatorics"}],"container-title":["Algorithm Engineering and Experimentation","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48518-X_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T12:18:05Z","timestamp":1556972285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48518-X_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662273","9783540485186"],"references-count":24,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-48518-x_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[1999]]}}}