{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:12:53Z","timestamp":1648908773389},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":[[1982,12]]},"DOI":"10.1007\/bf01583800","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:31:20Z","timestamp":1114662680000},"page":"353-356","source":"Crossref","is-referenced-by-count":2,"title":["An extension of the edge covering problem"],"prefix":"10.1007","volume":"23","author":[{"given":"S.","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. K.","family":"Mittal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"303","volume-title":"Proceedings of the Princeton symposium on mathematical programming","author":"M.L. Balinski","year":"1970","unstructured":"M.L. Balinski, \u201cOn maximum matching, minimum covering and their connections\u201d, in: H.W. Kuhn, ed.,Proceedings of the Princeton symposium on mathematical programming (Princeton University Press, Princeton, NJ, 1970) pp. 303\u2013312."},{"key":"CR2","volume-title":"Integer programming","author":"R.S. Garfinkel","year":"1972","unstructured":"R.S. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972)."},{"key":"CR3","doi-asserted-by":"crossref","DOI":"10.21236\/AD0614578","volume-title":"\u201cProgramming in networks and graphs\u201d, Tech. Rept. ORC 65.1","author":"E.L. Johnson","year":"1965","unstructured":"E.L. Johnson, \u201cProgramming in networks and graphs\u201d, Tech. Rept. ORC 65.1, University of California, Berkeley (1965)."},{"key":"CR4","volume-title":"\u201cNotes on covering of arcs by nodes in an undirected graph\u201d, Tech. Rept. ORC 66.16","author":"L.C. Lorentzen","year":"1966","unstructured":"L.C. Lorentzen, \u201cNotes on covering of arcs by nodes in an undirected graph\u201d, Tech. Rept. ORC 66.16, University of California, Berkeley (1966)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"G.L. Nemhauser and R.E. Trotter, \u201cVertex packing structural properties and algorithms\u201d,Mathematical Programming 8 (1975) 232\u2013248.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583800.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01583800\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01583800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:29:24Z","timestamp":1556882964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01583800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01583800"],"URL":"https:\/\/doi.org\/10.1007\/bf01583800","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}