{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:00Z","timestamp":1725663780329},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_268","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:06:36Z","timestamp":1330257996000},"page":"433-441","source":"Crossref","is-referenced-by-count":4,"title":["Designing multi-commodity flow trees"],"prefix":"10.1007","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[]},{"given":"Balaji","family":"Raghavachari","sequence":"additional","affiliation":[]},{"given":"Neal","family":"Young","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"40_CR1","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, \u201cComputers and Intractability: A guide to the theory of NP-completeness\u201d, Freeman, San Francisco (1979)."},{"issue":"4","key":"40_CR2","first-page":"551","volume":"9","author":"R. E. Gomory","year":"1961","unstructured":"R. E. Gomory and T. C. Hu. Multi-terminal network flows. Journal of SIAM, 9(4): 551\u2013570, 1961.","journal-title":"Journal of SIAM"},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D. Gusfield","year":"1990","unstructured":"D. Gusfield. Very simple methods for all pairs network flow analysis. SIAM Journal on Computing, 19(1): 143\u2013155, 1990.","journal-title":"SIAM Journal on Computing"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"F. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. 29th Annual Symp. on Foundations of Computer Science, pages 422\u2013431, October 1988. White Plains, NY.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"40_CR5","unstructured":"S. Rao. Personal communication."},{"key":"40_CR6","unstructured":"P. Seymour and R. Thomas. Call routing and the rat catcher. Workshop on Algorithms and Combinatorial Optimization, March 1991. Atlanta, GA."},{"key":"40_CR7","unstructured":"\u00c9. Tardos. Personal communication."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_268.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:22Z","timestamp":1605647302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_268","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}