{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T13:08:38Z","timestamp":1773320918406,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540108542","type":"print"},{"value":"9783540387657","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10854-8_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:30:17Z","timestamp":1330173017000},"page":"205-209","source":"Crossref","is-referenced-by-count":48,"title":["Mathematical structures underlying greedy algorithms"],"prefix":"10.1007","author":[{"given":"B.","family":"Korte","sequence":"first","affiliation":[]},{"given":"L.","family":"Lov\u00e1sz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,28]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959) 269\u2013271.","journal-title":"Numer. Math."},{"key":"22_CR2","unstructured":"J. Edmonds, Submodular functions, matroids, and certain polyhedra, in: Combinatorial Structures and their Applications, Gordon and Breach, 1970."},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"B71","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, Optimum brauchings, J. Res. Nat. Bur. Stand. B71 (1967) 233\u2013240.","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"E. Lawler","year":"1973","unstructured":"E. Lawler, Optimal sequencing of a single machine subject to precendence constraints, Management Sci. 19 (1973) 544\u2013546.","journal-title":"Management Sci."},{"key":"22_CR5","unstructured":"D. Welsh, Matroid Theory, Academic Press, 1976."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10854-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:39:45Z","timestamp":1619541585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10854-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108542","9783540387657"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-10854-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981]]}}}