{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:28:23Z","timestamp":1678667303000},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":[[1994,4]]},"DOI":"10.1016\/0020-0190(94)90044-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"49-55","source":"Crossref","is-referenced-by-count":14,"title":["Designing multi-commodity flow trees"],"prefix":"10.1016","volume":"50","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balaji","family":"Raghavachari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neal","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90044-2_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"4","key":"10.1016\/0020-0190(94)90044-2_BIB2","first-page":"551","article-title":"Multi-terminal network flows","volume":"9","author":"Gomory","year":"1961","journal-title":"J. SIAM"},{"issue":"1","key":"10.1016\/0020-0190(94)90044-2_BIB3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0219009","article-title":"Very simple methods for all pairs network flow analysis","volume":"19","author":"Gusfield","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90044-2_BIB4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/SFCS.1988.21958","article-title":"An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms","author":"Leighton","year":"1988","journal-title":"Proc. 29th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)90044-2_BIB5","article-title":"Call routing and the rat cathcer","author":"Seymour","year":"1991","journal-title":"Proc. Workshop on Algorithms and Combinatorial Optimization"},{"key":"10.1016\/0020-0190(94)90044-2_BIB6","series-title":"Tech. Rept. 93-02","article-title":"Improved approximations for the minimum-cut ratio and the flux","author":"Tragoudas","year":"1993"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900442?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900442?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:38:06Z","timestamp":1580899086000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0020019094900442"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90044-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}