{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T12:26:36Z","timestamp":1672575996718},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,29]],"date-time":"2011-01-29T00:00:00Z","timestamp":1296259200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10878-011-9377-3","type":"journal-article","created":{"date-parts":[[2011,1,28]],"date-time":"2011-01-28T17:10:39Z","timestamp":1296234639000},"page":"202-228","source":"Crossref","is-referenced-by-count":3,"title":["Min-cost multiflows in node-capacitated undirected networks"],"prefix":"10.1007","volume":"24","author":[{"given":"Maxim A.","family":"Babenko","sequence":"first","affiliation":[]},{"given":"Alexander V.","family":"Karzanov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,29]]},"reference":[{"issue":"13","key":"9377_CR1","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1016\/j.dam.2007.02.012","volume":"155","author":"MA Babenko","year":"2007","unstructured":"Babenko MA, Karzanov AV (2007) Free multiflows in bidirected and skew-symmetric graphs. Discrete Appl Math 155(13):1715\u20131730","journal-title":"Discrete Appl Math"},{"issue":"1","key":"9377_CR2","first-page":"143","volume":"13","author":"BV Cherkassky","year":"1977","unstructured":"Cherkassky BV (1977) A solution of a problem on multicommodity flows in a network. Ekon Mat Metody 13(1):143\u2013151 (in Russian)","journal-title":"Ekon Mat Metody"},{"key":"9377_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J Edmonds","year":"1977","unstructured":"Edmonds J, Giles R (1977) A min\u2013max relation for submodular functions on graphs. Ann Discrete Math 1:185\u2013204","journal-title":"Ann Discrete Math"},{"key":"9377_CR4","first-page":"89","volume-title":"Combinatorial structures and their applications","author":"J Edmonds","year":"1970","unstructured":"Edmonds J, Johnson EL (1970) Matching: a well-solved class of integer linear programs. In: Guy R, Hanani H, Sauer N, Sch\u00f6nhein J (eds) Combinatorial structures and their applications. Gordon and Breach, New York, pp\u00a089\u201392"},{"key":"9377_CR5","volume-title":"Flows in networks","author":"L Ford","year":"1962","unstructured":"Ford L, Fulkerson D (1962) Flows in networks. Princeton University Press, Princeton"},{"issue":"3","key":"9377_CR6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01261321","volume":"16","author":"AV Goldberg","year":"1996","unstructured":"Goldberg AV, Karzanov AV (1996) Path problems in skew-symmetric graphs. Combinatorica 16(3):353\u2013382","journal-title":"Combinatorica"},{"issue":"1","key":"9377_CR7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1287\/moor.22.1.90","volume":"22","author":"AV Goldberg","year":"1997","unstructured":"Goldberg AV, Karzanov AV (1997) Scaling methods for finding a maximum free multiflow of minimum cost. Math Oper Res 22(1):90\u2013109","journal-title":"Math Oper Res"},{"issue":"3","key":"9377_CR8","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/s10107-004-0505-z","volume":"100","author":"AV Goldberg","year":"2004","unstructured":"Goldberg AV, Karzanov AV (2004) Maximum skew-symmetric flows and matchings. Math Program 100(3):537\u2013568","journal-title":"Math Program"},{"issue":"1","key":"9377_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/PL00009811","volume":"18","author":"T Ibaraki","year":"1998","unstructured":"Ibaraki T, Karzanov AV, Nagamochi H (1998) A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations. Combinatorica 18(1):61\u201383","journal-title":"Combinatorica"},{"key":"9377_CR10","first-page":"138","volume-title":"Combinatorial methods for flow problems","author":"AV Karzanov","year":"1979","unstructured":"Karzanov AV (1979) A problem on maximum multiflow of minimum cost. In: Combinatorial methods for flow problems. Inst for System Studies Press, Moscow, pp\u00a0138\u2013156, issue 3 (in Russian)"},{"key":"9377_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0024-3795(89)90468-0","volume":"114\/115","author":"AV Karzanov","year":"1989","unstructured":"Karzanov AV (1989) Polyhedra related to undirected multicommodity flows. Linear Algebra Appl 114\/115:293\u2013328","journal-title":"Linear Algebra Appl"},{"issue":"3","key":"9377_CR12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01581152","volume":"66","author":"AV Karzanov","year":"1994","unstructured":"Karzanov AV (1994) Minimum cost multiflows in undirected networks. Math Program 66(3):313\u2013325","journal-title":"Math Program"},{"key":"9377_CR13","volume-title":"Combinatorial optimization: networks and matroids","author":"EL Lawler","year":"1976","unstructured":"Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt, Reinhart, and Winston, New York"},{"key":"9377_CR14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L Lov\u00e1sz","year":"1976","unstructured":"Lov\u00e1sz L (1976) On some connectivity properties of Eulerian graphs. Acta Math Acad Sci Hung 28:129\u2013138","journal-title":"Acta Math Acad Sci Hung"},{"key":"9377_CR15","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1145\/1250790.1250878","volume-title":"STOC \u201907: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing","author":"G Pap","year":"2007","unstructured":"Pap G (2007) Some new results on node-capacitated packing of a-paths. In: STOC \u201907: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. ACM, New York, pp\u00a0599\u2013604"},{"key":"9377_CR16","volume-title":"Combinatorial optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization. Springer, Berlin"},{"key":"9377_CR17","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.4153\/CJM-1967-101-8","volume":"19","author":"WT Tutte","year":"1967","unstructured":"Tutte WT (1967) Antisymmetrical digraphs. Can J Math 19:1101\u20131117","journal-title":"Can J Math"},{"key":"9377_CR18","volume-title":"Approximation algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani V (2001) Approximation algorithms. Springer, Berlin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9377-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9377-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9377-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:15Z","timestamp":1559276595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9377-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,29]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9377"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9377-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,29]]}}}