{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:21Z","timestamp":1761620841007},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00467-5","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:09:00Z","timestamp":1062601740000},"page":"449-465","source":"Crossref","is-referenced-by-count":5,"title":["A greedy algorithm for convex geometries"],"prefix":"10.1016","volume":"131","author":[{"given":"Kenji","family":"Kashiwabara","sequence":"first","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00467-5_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(01)00318-3","article-title":"K-subdmodular functions and convexity of their Lov\u00e1sz extension","volume":"122","author":"Ando","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00467-5_BIB2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(90)90002-T","article-title":"An algorithmic characterization of antimatroids","volume":"28","author":"Boyd","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00467-5_BIB3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF00149365","article-title":"The theory of convex geometries","volume":"19","author":"Edelman","year":"1985","journal-title":"Geom. Dedicata"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB4","series-title":"Proceedings of the Calgary International Conference on Combinatorial Structures and their Applications","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02592089","article-title":"Submodular linear programs on forests","volume":"72","author":"Faigle","year":"1996","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB6","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s101070050008","article-title":"On the core of ordered submodular cost games","volume":"87","author":"Faigle","year":"2000","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1006406424957","article-title":"An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games","volume":"17","author":"Faigle","year":"2000","journal-title":"Order"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB8","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s101070050040","article-title":"Increasing the rooted-connectivity of a digraph by one","volume":"84","author":"Frank","year":"1999","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB9","series-title":"Submodular Functions and Optimization","author":"Fujishige","year":"1991"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB10","series-title":"Greedoids","author":"Korte","year":"1991"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0166-218X(99)00129-8","article-title":"Structural aspects of ordered polymatroids","volume":"99","author":"Kr\u00fcger","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00467-5_BIB12","series-title":"Mathematical Programming\u2014The State of the Art","first-page":"235","article-title":"Submodular functions and convexity","author":"Lov\u00e1sz","year":"1983"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB13","unstructured":"M. Nakamura, Algorithmic characterizations of non-simple greedoids and antimatroids, Proceedings of the Fifth Japan\u2013Korea Joint Workshop on Algorithms and Computation, 2000, pp. 122\u2013129."},{"key":"10.1016\/S0166-218X(02)00467-5_BIB14","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0166-218X(02)00467-5_BIB15","series-title":"Semimodular Lattices: Theory and Applications","author":"Stern","year":"1999"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004675?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004675?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T11:55:08Z","timestamp":1551095708000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004675"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00467-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}