{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:17Z","timestamp":1751282837084},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1975,12,1]],"date-time":"1975-12-01T00:00:00Z","timestamp":186624000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1975,12]]},"DOI":"10.1007\/bf01580426","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:57:06Z","timestamp":1114678626000},"page":"20-42","source":"Crossref","is-referenced-by-count":11,"title":["An efficient algorithm for minimumk-covers in weighted graphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Lee J.","family":"White","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark L.","family":"Gillenson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"13","key":"CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"M.L. Balinski","year":"1965","unstructured":"M.L. Balinski, \u201cInteger programming: methods, uses, computations\u201d,Management Science 12 (13) (1965) 253\u2013313.","journal-title":"Management Science"},{"key":"CR2","unstructured":"M.L. Balinski, \u201cLabelling to obtain a maximum matching\u201d,Proceedings of the conference on combinatorial mathematics and its applications, University of North Carolina, April, 1967."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(72)90002-0","volume":"13","author":"M.L. Balinski","year":"1972","unstructured":"M.L. Balinski, \u201cEstablishing the matching polytope\u201d,Journal of Combinatorial Theory 13 (1972) 1\u201313.","journal-title":"Journal of Combinatorial Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"C. Berge, \u201cTwo theorems in graph theory\u201d,Proceedings of the National Academy of Sciences of the U.S.A. 43 (1957) 842\u2013844.","journal-title":"Proceedings of the National Academy of Sciences of the U.S.A."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1090\/S0002-9904-1962-10791-5","volume":"68","author":"J. Edmonds","year":"1962","unstructured":"J. Edmonds, \u201cCovers and packings in a family of sets\u201d,Bulletin of the American Mathematical Society 68 (1962) 494\u2013499.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cPaths, trees, and flowers\u201d,Canadian Journal of Mathematics 17 (1965) 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and polyhedron with 0, 1-vertices\u201d,Journal of Research of the National Bureau of Standards 69B (1965) 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"CR8","first-page":"89","volume-title":"Combinatorial structures and their applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and E. Johnson, \u201cMatching: a well-solved class of integer linear programs\u201d, in: H. Guy, ed.,Combinatorial structures and their applications (Gordon and Breach, New York, 1970) pp. 89\u201392."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"H. Everett III","year":"1963","unstructured":"H. Everett III, \u201cGeneralized Lagrange multiplier method for solving problems of optimum allocation of resources\u201d,Operations Research 11 (1963) 399\u2013417.","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal Jr.","year":"1956","unstructured":"J.B. Kruskal, Jr., \u201cOn the shortest spanning subtree of a graph and the traveling salesman problem\u201d,Proceedings of the American Mathematical Society 7 (1956) 48\u201350.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1090\/S0002-9939-1959-0106853-5","volume":"10","author":"R.Z. Norman","year":"1959","unstructured":"R.Z. Norman and M.O. Rabin, \u201cAn algorithm for a minimum cover of a graph\u201d,Proceedings of the American Mathematical Society 10 (1959) 315\u2013319.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"CR12","volume-title":"A parametric study of matchings and coverings in weighted graphs","author":"L.J. White","year":"1967","unstructured":"L.J. White, \u201cA parametric study of matchings and coverings in weighted graphs\u201d, Ph.D. Thesis, Tech. Rept. 06920-11-T, Systems Engineering Laboratory, The University of Michigan, Ann Arbor, Mi (1967)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0121014","volume":"21","author":"L.J. White","year":"1971","unstructured":"L.J. White, \u201cMinimum covers of fixed cardinality in weighted graphs\u201d,SIAM Journal of Applied Mathematics 21 (1971) 104\u2013113.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR14","volume-title":"\u201cOptimum center allocation\u201d, Tech. Rept. OSU-CISRC-TR-72-1","author":"L.J. White","year":"1972","unstructured":"L.J. White and M.L. Gillenson, \u201cOptimum center allocation\u201d, Tech. Rept. OSU-CISRC-TR-72-1, Computer and Information Science Research Center, The Ohio State University, Columbus, Ohio (1972)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580426.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580426\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:08Z","timestamp":1556896328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,12]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1975,12]]}},"alternative-id":["BF01580426"],"URL":"https:\/\/doi.org\/10.1007\/bf01580426","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,12]]}}}