{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T05:11:23Z","timestamp":1723353083159},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":12616,"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":[[1979]]},"DOI":"10.1016\/0012-365x(79)90092-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"153-159","source":"Crossref","is-referenced-by-count":34,"title":["The greedy algorithm for partially ordered sets"],"prefix":"10.1016","volume":"28","author":[{"given":"Ulrich","family":"Faigle","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(79)90092-X_BIB1","series-title":"Proc. Int. Conf. Comb. Calgary","first-page":"69","article-title":"Submodular functions, matroids and certain polyhedra","author":"Edmond","year":"1970"},{"key":"10.1016\/0012-365X(79)90092-X_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","article-title":"Matroids and the greedy algorithm","volume":"1","author":"Edmonds","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(79)90092-X_BIB3","series-title":"Report No. 7761-OR","article-title":"Die Bestimmung maximaler Elemente in monotonen Mengensystemen","author":"Euler","year":"1977"},{"key":"10.1016\/0012-365X(79)90092-X_BIB4","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/BF01580137","article-title":"A greedy algorithm for solving a class of linear programmes","volume":"5","author":"Dunstan","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(79)90092-X_BIB5","unstructured":"U. Faigle, Geometries on partially ordered sets, to appear in J. Combinatorial Theory B."},{"key":"10.1016\/0012-365X(79)90092-X_BIB6","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","article-title":"Optimal assignments in an ordered set: an application of matroid theory","volume":"4","author":"Gale","year":"1968","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0012-365X(79)90092-X_BIB7","unstructured":"P.L. Hammer, E.L. Johnson and U.N. Peled, Regular 0\u20131 programs, Univ. Waterloo, Comb. and Op. Res. Report CORR 73\u201318, Sept. 73."},{"key":"10.1016\/0012-365X(79)90092-X_BIB8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subgraph of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(79)90092-X_BIB9","series-title":"Combinatorial Optimization: Networks and Matroid","author":"Lawler","year":"1976"},{"key":"10.1016\/0012-365X(79)90092-X_BIB10","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1112\/plms\/s3-7.1.300","article-title":"Note on independence functions","volume":"7","author":"Rado","year":"1957","journal-title":"Proc. Lond. Math. Soc."},{"key":"10.1016\/0012-365X(79)90092-X_BIB11","article-title":"Ordered Structures and Partitions","volume":"119","author":"Stanley","year":"1972","journal-title":"Memoirs Am. Math. Soc."},{"key":"10.1016\/0012-365X(79)90092-X_BIB12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/S030500410004247X","article-title":"Kruskal's theorem for matroids","volume":"64","author":"Welsh","year":"1968","journal-title":"Proc. Cambr. Phil. Soc."},{"key":"10.1016\/0012-365X(79)90092-X_BIB13","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X7990092X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X7990092X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:23:30Z","timestamp":1555154610000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X7990092X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979]]}},"alternative-id":["0012365X7990092X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(79)90092-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}