{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T12:20:29Z","timestamp":1709382029257},"reference-count":6,"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(02)00047-3","type":"journal-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T19:08:58Z","timestamp":1041275338000},"page":"399-402","source":"Crossref","is-referenced-by-count":19,"title":["A note on Schrijver's submodular function minimization algorithm"],"prefix":"10.1016","volume":"88","author":[{"given":"Jens","family":"Vygen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(02)00047-3_BIB1","first-page":"1","article-title":"Recent progress in submodular function minimization","volume":"64","author":"Fleischer","year":"2000","journal-title":"OPTIMA"},{"key":"10.1016\/S0095-8956(02)00047-3_BIB2","doi-asserted-by":"crossref","unstructured":"L. Fleischer, S. Iwata, Improved algorithms for submodular function minimization and submodular flow, Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, 2000, pp. 107\u2013116.","DOI":"10.1145\/335305.335318"},{"key":"10.1016\/S0095-8956(02)00047-3_BIB3","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/S0095-8956(02)00047-3_BIB4","series-title":"Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization","first-page":"1","article-title":"A faster scaling algorithm for minimizing submodular functions","volume":"Vol. 2337","author":"Iwata","year":"2002"},{"key":"10.1016\/S0095-8956(02)00047-3_BIB5","doi-asserted-by":"crossref","unstructured":"S. Iwata, L. Fleischer, S. Fujishige, A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions, Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing, 2000, pp. 97\u2013106.","DOI":"10.1145\/335305.335317"},{"key":"10.1016\/S0095-8956(02)00047-3_BIB6","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"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000473?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000473?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T14:22:59Z","timestamp":1553955779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895602000473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0095895602000473"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(02)00047-3","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}