{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:39:06Z","timestamp":1743093546460,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_11","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"124-135","source":"Crossref","is-referenced-by-count":4,"title":["A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem"],"prefix":"10.1007","author":[{"given":"Maxim A.","family":"Babenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander V.","family":"Karzanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-74510-5_10","volume-title":"Computer Science \u2013 Theory and Applications","author":"M.A. Babenko","year":"2007","unstructured":"Babenko, M.A.: A fast algorithm for path 2-packing problem. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol.\u00a04649, pp. 70\u201381. Springer, Heidelberg (2007)"},{"issue":"1","key":"11_CR2","first-page":"143","volume":"13","author":"B.V. Cherkassky","year":"1977","unstructured":"Cherkassky, B.V.: A solution of a problem on multicommodity flows in a network. Ekonomika i Matematicheskie Metody\u00a013(1), 143\u2013151 (1977)","journal-title":"Ekonomika i Matematicheskie Metody"},{"key":"11_CR3","volume-title":"Flows in Networds","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networds. Princeton University Press, Princeton (1962)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0167-5060(08)70459-X","volume":"41","author":"A. Frank","year":"1989","unstructured":"Frank, A.: On connectivity properties of Eulerian digraphs. Ann. Discrete Math.\u00a041, 179\u2013194 (1989)","journal-title":"Ann. Discrete Math."},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM\u00a045(5), 783\u2013797 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/PL00009811","volume":"18","author":"T. Ibaraki","year":"1998","unstructured":"Ibaraki, T., Karzanov, A.V., Nagamochi, H.: A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations. Combinatorica\u00a018(1), 61\u201383 (1998)","journal-title":"Combinatorica"},{"key":"11_CR7","unstructured":"Karzanov, A.V.: Combinatorial methods to solve cut-dependent multiflow problems. Combinatorial Methods for Flow Problems (Inst. for System Studies, Moscow\u00a0(3), 6\u201369 (1979) (in russian)"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01581152","volume":"66","author":"A.V. Karzanov","year":"1994","unstructured":"Karzanov, A.V.: Minimum cost multiflows in undirected networks. Math. Program.\u00a066(3), 313\u2013325 (1994)","journal-title":"Math. Program."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L. Lov\u00e1sz","year":"1976","unstructured":"Lov\u00e1sz, L.: On some connectivity properties of Eulerian graphs. Acta Math. Akad. Sci. Hung.\u00a028, 129\u2013138 (1976)","journal-title":"Acta Math. Akad. Sci. Hung."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L. Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Matroid matching and some applications. J. Combinatorial Theory, Ser. B\u00a028, 208\u2013236 (1980)","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1145\/1250790.1250878","volume-title":"STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","author":"G. Pap","year":"2007","unstructured":"Pap, G.: Some new results on node-capacitated packing of a-paths. In: STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 599\u2013604. ACM Press, New York (2007)"},{"key":"11_CR12","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, vol.\u00a0A, C. Springer, Heidelberg (2003)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D. Sleator","year":"1983","unstructured":"Sleator, D., Tarjan, R.: A data structure for dynamic trees. J. Comput. Syst. Sci.\u00a026(3), 362\u2013391 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR14","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:15:12Z","timestamp":1715058912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}