{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T05:44:12Z","timestamp":1747115052635},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3705,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0095-8956(03)00034-0","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T02:16:19Z","timestamp":1051236979000},"page":"323-327","source":"Crossref","is-referenced-by-count":5,"title":["Improved bound for the Carath\u00e9odory rank of the bases of a matroid"],"prefix":"10.1016","volume":"88","author":[{"given":"Jos\u00e9 Coelho","family":"de Pina","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Soares","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(03)00034-0_BIB1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1515\/crll.1999.045","article-title":"A counterexample to an integer analogue of Carath\u00e9odory's theorem","volume":"510","author":"Bruns","year":"1999","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/S0095-8956(03)00034-0_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0095-8956(86)90064-X","article-title":"An integer analogue of Carath\u00e9odory's theorem","volume":"40","author":"Cook","year":"1986","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/S0095-8956(03)00034-0_BIB3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","article-title":"Minimum partition of a matroid into independent subsets","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/S0095-8956(03)00034-0_BIB4","series-title":"Combinatorial Structures and their Applications","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/S0095-8956(03)00034-0_BIB5","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\/S0095-8956(03)00034-0_BIB6","first-page":"97","article-title":"An algorithm for submodular functions on graphs","volume":"Vol. 16","author":"Frank","year":"1982"},{"key":"10.1016\/S0095-8956(03)00034-0_BIB7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0095-8956(84)90029-7","article-title":"Findings feasible vectors of Edmonds\u2013Giles polyhedra","volume":"36","author":"Frank","year":"1984","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/S0095-8956(03)00034-0_BIB8","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/502090.502096","article-title":"A combinatorial strongly polynomial algorithm for minimizing submodular functions","volume":"48","author":"Iwata","year":"2001","journal-title":"J. ACM"},{"key":"10.1016\/S0095-8956(03)00034-0_BIB9","series-title":"Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0095-8956(03)00034-0_BIB10","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jctb.2000.1989","article-title":"A combinatorial algorithm minimizing submodular functions in strongly polynomial time","volume":"80","author":"Schrijver","year":"2000","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/S0095-8956(03)00034-0_BIB11","series-title":"Integer Programming and Combinatorial Optimization","first-page":"431","article-title":"Hilbert bases, Carath\u00e9odory's theorem and combinatorial optimization","author":"Seb\u0151","year":"1990"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000340?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000340?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T13:13:01Z","timestamp":1584623581000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0095895603000340"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00034-0","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}