{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:05Z","timestamp":1725488585664},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_60","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"535-539","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Maximum Matroid-Greedoid Intersection"],"prefix":"10.1007","author":[{"given":"Taneli","family":"Mielik\u00e4inen","sequence":"first","affiliation":[]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-642-58412-1"},{"key":"60_CR2","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1137\/S0097539796304220","volume":"28","author":"P. Crescenzi","year":"1999","unstructured":"P. Crescenzi, V. Kann, R. Silvestri, and L. Trevisan. Structure in approximation classes. SIAM Journal on Computing 28 (1999) 1759\u20131782.","journal-title":"SIAM Journal on Computing"},{"key":"60_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Minimum partition of a matroid into independent subsets. Journal of Research of the National Bureau of Standards 69B (1965) 67\u201372.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"60_CR4","unstructured":"M. R. Garey, and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979."},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"B. Korte, and J. Vygen. Combinatorial Optimization: Theory and Algorithms. Springer-Verlag, 2000.","DOI":"10.1007\/978-3-662-21708-5"},{"key":"60_CR6","unstructured":"C. H. Papadimitriou, and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, 1998."}],"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-44669-9_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T09:27:35Z","timestamp":1550741255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_60","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}