{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T23:19:21Z","timestamp":1700003961318},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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":[[1989,8]]},"DOI":"10.1007\/bf01589096","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:22:34Z","timestamp":1114690954000},"page":"49-58","source":"Crossref","is-referenced-by-count":6,"title":["Forest covers and a polyhedral intersection theorem"],"prefix":"10.1007","volume":"45","author":[{"given":"A. B.","family":"Gamble","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/net.3230130403","volume":"13","author":"J. Ar\u00e1oz","year":"1983","unstructured":"J. Ar\u00e1oz, W.H. Cunningham, J. Edmonds and J. Green-Kr\u00f3tki, \u201cReductions to 1-matching polyhedra,\u201dNetworks 13 (1983) 455\u2013473.","journal-title":"Networks"},{"key":"CR2","first-page":"221","volume-title":"Annals of Discrete Mathematics 8","author":"G. Calvillo","year":"1980","unstructured":"G. Calvillo, \u201cThe concavity and intersection properties for integral polyhedra,\u201d in: M. Deza and I.G. Rosenberg, eds.,Annals of Discrete Mathematics 8 (North-Holland, Amsterdam, 1980) pp. 221\u2013228."},{"key":"CR3","unstructured":"J.O. Cerdeira and C.J. Luz, \u201cCovering nodes with a fixed number of trees,\u201d Technical report, Nota no. 3\/85, Centro de Estat\u00edstica e Aplicac\u00f6es, Lisboa\/I.N.I.C."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"J. Edmonds, \u201cMatroids and the greedy algorithm,\u201dMathematical Programming 1 (1971) 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"CR5","first-page":"89","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds and E.L. Johnson, \u201cMatching: A well-solved class of integer linear programs,\u201d in: R.K. Guy, ed.,Combinatorial Structures and their Applications (Gordon and Breach, New York, 1970) pp. 89\u201392."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230120403","volume":"12","author":"K.G. Murty","year":"1982","unstructured":"K.G. Murty and C. Perin, \u201cA 1-matching blossom-type algorithm for edge covering problems,\u201dNetworks 12 (1982) 379\u2013391.","journal-title":"Networks"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/978-3-642-68874-4_13","volume-title":"Mathematical Programming-The State of the Art","author":"W.R. Pulleyblank","year":"1983","unstructured":"W.R. Pulleyblank, \u201cPolyhedral combinatorics,\u201d in: A. Bachem, M. Gr\u00f6tschel and B. Korte, eds.,Mathematical Programming-The State of the Art (Springer-Verlag, Heidelberg, 1983) pp. 312\u2013345."},{"key":"CR8","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,\u201dSIAM Journal of Applied Mathematics 21 (1971) 104\u2013113.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BF01580426","volume":"8","author":"L.J. White","year":"1975","unstructured":"L.J. White and M.L. Gillenson, \u201cAn efficient algorithm for minimumk-covers in weighted graphs,\u201dMathematical Programming 8 (1975) 20\u201342.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589096.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589096\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:36:31Z","timestamp":1556897791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01589096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["BF01589096"],"URL":"https:\/\/doi.org\/10.1007\/bf01589096","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}