{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T05:08:57Z","timestamp":1654146537057},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":[[1992,7]]},"DOI":"10.1016\/0020-0190(92)90229-o","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"315-319","source":"Crossref","is-referenced-by-count":9,"title":["Approximating the minimum-cost maximum flow is P-complete"],"prefix":"10.1016","volume":"42","author":[{"given":"Clifford","family":"Stein","sequence":"first","affiliation":[]},{"given":"Joel","family":"Wein","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90229-O_BIB1","series-title":"Tech. Rept.","article-title":"A P-complete problem and approximations to it","author":"Anderson","year":"1986"},{"key":"10.1016\/0020-0190(92)90229-O_BIB2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","article-title":"The maximum flow problem is log-space complete for P","volume":"21","author":"Goldschlager","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90229-O_BIB3","series-title":"Handbook of Theoretical Computer Science","first-page":"869","article-title":"A survey of parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0020-0190(92)90229-O_BIB4","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/SFCS.1989.63493","article-title":"The parallel complexity of the subgraph connectivity problem","author":"Kirousis","year":"1989","journal-title":"Proc. 30th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(92)90229-O_BIB5","article-title":"Probabilistic log-space reductions and problems probabilistically hard for P","author":"Kirousis","year":"1988","journal-title":"Proc. First Scandinavian Workshop on Algorithm Theory"},{"key":"10.1016\/0020-0190(92)90229-O_BIB6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(91)90194-M","article-title":"Approximating linear programming is log-space complete for P","volume":"37","author":"Serna","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90229-O_BIB7","series-title":"Proc. 2nd Internat. Symp. on Optimal Algorithms","first-page":"193","article-title":"The approximability of problems complete for P","volume":"401","author":"Serna","year":"1989"},{"key":"10.1016\/0020-0190(92)90229-O_BIB8","series-title":"Proc. 8th Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"118","article-title":"Tight RNC approximations to max flow","volume":"480","author":"Serna","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290229O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290229O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:54Z","timestamp":1555144074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290229O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290229O"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90229-o","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}