{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:53:23Z","timestamp":1649037203108},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0020-0190(01)00140-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:16:06Z","timestamp":1027617366000},"page":"285-290","source":"Crossref","is-referenced-by-count":0,"title":["A note on optimal covering augmentation for graphic polymatroids"],"prefix":"10.1016","volume":"79","author":[{"given":"Sachin B.","family":"Patkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0020-0190(01)00140-5_BIB001","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1137\/S0097539791199334","article-title":"Improved algorithms for bipartite network flow","volume":"23","author":"Ahuja","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00140-5_BIB002","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(94)90013-2","article-title":"A faster algorithm for computing the strength of a network","volume":"49","author":"Cheng","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0020-0190(01)00140-5_BIB003","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","article-title":"Optimal attack and reinforcement of a network","volume":"32","author":"Cunningham","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00140-5_BIB004","series-title":"Proc. Calgary Internat. Conference on Combinatorial Structures","first-page":"69","article-title":"Submodular functions, matroids and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/S0020-0190(01)00140-5_BIB005","series-title":"Submodular Functions and Optimization","author":"Fujishige","year":"1991"},{"key":"10.1016\/S0020-0190(01)00140-5_BIB006","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1006\/jagm.1997.0904","article-title":"Algorithms for graphic polymatroids and parametric s-sets","volume":"26","author":"Gabow","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00140-5_BIB007","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","article-title":"A fast parametric network flow algorithm","volume":"18","author":"Gallo","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00140-5_BIB008","doi-asserted-by":"crossref","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00140-5_BIB009","series-title":"Proc. 3rd ACM-SIAM SODA","first-page":"165","article-title":"A faster algorithm for finding the minimum cut in a graph","author":"Hao","year":"1992"},{"key":"10.1016\/S0020-0190(01)00140-5_BIB010","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jagm.1996.0047","article-title":"Approximation algorithms for min-k-overlap problems, using the principal lattice of partitions approach","volume":"21","author":"Narayanan","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00140-5_BIB011","series-title":"Submodular Functions and Electrical Networks","volume":"54","author":"Narayanan","year":"1997"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001405?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001405?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T10:23:59Z","timestamp":1555755839000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001001405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0020019001001405"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00140-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}