{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T04:07:07Z","timestamp":1781928427103,"version":"3.54.5"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"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":10730,"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":[[1984,3]]},"DOI":"10.1016\/0166-218x(84)90003-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"251-274","source":"Crossref","is-referenced-by-count":243,"title":["Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem"],"prefix":"10.1016","volume":"7","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(84)90003-9_BIB1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"4","author":"Chv\u00e1tal","year":"1979","journal-title":"Math. Operations Research"},{"key":"10.1016\/0166-218X(84)90003-9_BIB2","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms","volume":"23","author":"Cornu\u00e9jols","year":"1977","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(84)90003-9_BIB3","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\/0166-218X(84)90003-9_BIB4","series-title":"Combinatorial Structures and Their Applications","first-page":"68","article-title":"Submodular functions, matroids and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/0166-218X(84)90003-9_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","article-title":"An analysis of approximations for maximizing submodular set functions II","volume":"8","author":"Fisher","year":"1978","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(84)90003-9_BIB6","series-title":"Proc. 7th S.E. Conf. Combinatorics, Graph Theory and Computing","first-page":"341","article-title":"The efficacity of the greedy algorithm","author":"Jenkyns","year":"1976"},{"key":"10.1016\/0166-218X(84)90003-9_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0167-5060(08)70322-4","article-title":"An analysis of the greedy heuristic for independence systems","volume":"2","author":"Korte","year":"1978","journal-title":"Annals Discrete Math."},{"key":"10.1016\/0166-218X(84)90003-9_BIB8","series-title":"A representation theorem for preference for flexibility","author":"Kreps","year":"1978"},{"key":"10.1016\/0166-218X(84)90003-9_BIB9","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0166-218X(84)90003-9_BIB10","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(84)90003-9_BIB11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions I","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(84)90003-9_BIB12","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900039?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:26:56Z","timestamp":1555136816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X84900039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["0166218X84900039"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(84)90003-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}