{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T14:40:10Z","timestamp":1706625610490},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9939,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1016\/0012-365x(86)90176-7","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"297-314","source":"Crossref","is-referenced-by-count":3,"title":["Non-interval greedoids and the transposition property"],"prefix":"10.1016","volume":"59","author":[{"given":"Bernhard","family":"Korte","sequence":"first","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Lov\u00e1sz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(86)90176-7_BIB1","series-title":"Matroid Theory and its Applications, Conference Proceedings","first-page":"25","article-title":"On matroids, groups and exchange languages","volume":"Vol. 40","author":"Bj\u00f6rner","year":"1985"},{"key":"10.1016\/0012-365X(86)90176-7_BIB2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0001-8708(84)90042-2","article-title":"Selectors, A theory of formal languages, semimodular lattices, branching and shelling processes","volume":"54","author":"Crapo","year":"1984","journal-title":"Adv. in Math."},{"key":"10.1016\/0012-365X(86)90176-7_BIB3","series-title":"Combinatorics","first-page":"271","article-title":"Crowns in dismantable partially ordered sets","volume":"18","author":"Duffus","year":"1976"},{"key":"10.1016\/0012-365X(86)90176-7_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","article-title":"Systems of distinct representative and linear algebra","volume":"71B","author":"Edmonds","year":"1967","journal-title":"J. Res. Nat. Bur. Standards B"},{"key":"10.1016\/0012-365X(86)90176-7_BIB5","unstructured":"O. Goecke, private communication."},{"key":"10.1016\/0012-365X(86)90176-7_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(86)90176-7_BIB7","series-title":"Fundamentals of Computation Theory","first-page":"205","article-title":"Mathematical structures underlying greedy algorithms","volume":"117","author":"Korte","year":"1981"},{"key":"10.1016\/0012-365X(86)90176-7_BIB8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0195-6698(85)80022-6","article-title":"A note on selectors and greedoids","volume":"6","author":"Korte","year":"1985","journal-title":"European J. Combin."},{"issue":"3\u20134","key":"10.1016\/0012-365X(86)90176-7_BIB9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02579192","article-title":"Structural properties of greedoids","volume":"3","author":"Korte","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(86)90176-7_BIB10","series-title":"Matroid Theory and its Applications, Conference Proceedings","first-page":"239","article-title":"Posets, matroids and greedoids","volume":"Vol. 40","author":"Korte","year":"1985"},{"key":"10.1016\/0012-365X(86)90176-7_BIB11","doi-asserted-by":"crossref","unstructured":"B. Korte and L. Lov\u00e1sz, Relations between subclasses of greedoids, Z. Oper. Res. Ser. A, to appear.","DOI":"10.1007\/BF01918757"},{"key":"10.1016\/0012-365X(86)90176-7_BIB12","series-title":"Progress in Combinatorial Optimization, Proc. Silver Jubilee Conference on Combinatorics","first-page":"221","article-title":"Greedoids, a structural framework for the greedy algorithm","author":"Korte","year":"1984"},{"key":"10.1016\/0012-365X(86)90176-7_BIB13","series-title":"Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conference in Honour of Paul Erd\u00f6s","first-page":"219","article-title":"Shelling structures, convexity and a happy end","author":"Korte","year":"1984"},{"key":"10.1016\/0012-365X(86)90176-7_BIB14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0095-8956(85)90091-7","article-title":"Polymatroid greedoids","volume":"38","author":"Korte","year":"1985","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86901767?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X86901767?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:53:03Z","timestamp":1553946783000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X86901767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["0012365X86901767"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(86)90176-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}