{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:14:10Z","timestamp":1648635250709},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T00:00:00Z","timestamp":1307059200000},"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,11]]},"DOI":"10.1007\/s10878-011-9405-3","type":"journal-article","created":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T00:17:43Z","timestamp":1307060263000},"page":"526-539","source":"Crossref","is-referenced-by-count":0,"title":["On the fractionality of the path packing problem"],"prefix":"10.1007","volume":"24","author":[{"given":"Natalia","family":"Vanetik","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,3]]},"reference":[{"key":"9405_CR1","unstructured":"Barsky E, Ilani H (2003) NP-hardness of one class of path packing problem. Manuscript"},{"key":"9405_CR2","first-page":"143","volume":"13","author":"BV Cherkassky","year":"1977","unstructured":"Cherkassky BV (1977) Solution of a problem on multicommodity flows in a network. Ekon Mat Metody 13:143\u2013151","journal-title":"Ekon Mat Metody"},{"key":"9405_CR3","first-page":"1277","volume":"11","author":"EA Dinic","year":"1970","unstructured":"Dinic EA (1970) Algorithm for the solution of a problem of maximum flow in networks with power estimation. Sov Math Dokl 11:1277\u20131280 (in Russian)","journal-title":"Sov Math Dokl"},{"key":"9405_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford Jr","year":"1956","unstructured":"Ford LR Jr, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399\u2013404","journal-title":"Can J Math"},{"key":"9405_CR5","volume-title":"Paths, flows, and VLSI-layout","author":"A Frank","year":"1990","unstructured":"Frank A (1990) Packing paths, circuits and cuts\u2014a survey. In: Korte B, Lov\u00e3sz L, Pr\u00f6mel HJ, Schrijver A (eds) Paths, flows, and VLSI-layout. Springer, Berlin"},{"key":"9405_CR6","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1016\/j.jctb.2009.03.001","volume":"99","author":"H Hirai","year":"2009","unstructured":"Hirai H (2009) Tight spans of distances and the dual fractionality of undirected multiflow problems. J\u00a0Comb Theory, Ser B 99:843\u2013868","journal-title":"J\u00a0Comb Theory, Ser B"},{"key":"9405_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s00493-010-2447-9","volume":"30","author":"H Hirai","year":"2010","unstructured":"Hirai H (2010) Metric packing for K3 + K3. Combinatorica 30:295\u2013326","journal-title":"Combinatorica"},{"key":"9405_CR8","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"11","author":"TC Hu","year":"1963","unstructured":"Hu TC (1963) Multi-commodity network flows. Oper Res 11:344\u2013360","journal-title":"Oper Res"},{"key":"9405_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jctb.2000.1958","volume":"79","author":"H Ilani","year":"2000","unstructured":"Ilani H, Korach E, Lomonosov M (2000) On extremal multiflows. J Comb Theory, Ser B 79:183\u2013210","journal-title":"J Comb Theory, Ser B"},{"key":"9405_CR10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0024-3795(89)90468-0","volume":"114\u2013115","author":"A Karzanov","year":"1989","unstructured":"Karzanov A (1989) Polyhedra related to undirected multicommodity flows. Linear Algebra Appl 114\u2013115:293\u2013328","journal-title":"Linear Algebra Appl"},{"key":"9405_CR11","series-title":"Work collection","first-page":"59","volume-title":"Math programming. Problems of social and economical systems. Operations research models","author":"A Karzanov","year":"1978","unstructured":"Karzanov A, Lomonosov M (1978) Systems of flows in undirected networks. In: Math programming. Problems of social and economical systems. Operations research models. Work collection, Moscow, vol\u00a01, pp\u00a059\u201366 (in Russian)"},{"issue":"1","key":"9405_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(85)90004-6","volume":"11","author":"M Lomonosov","year":"1985","unstructured":"Lomonosov M (1985) Combinatorial approaches to multiflow problems. Appl Discrete Math 11(1):1\u201393","journal-title":"Appl Discrete Math"},{"issue":"1","key":"9405_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejc.2003.09.002","volume":"25","author":"M Lomonosov","year":"2004","unstructured":"Lomonosov M (2004) On return path packing. Eur J Comb 25(1):35\u201353","journal-title":"Eur J Comb"},{"key":"9405_CR14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L Lov\u00e3sz","year":"1976","unstructured":"Lov\u00e3sz L (1976) On some connectivity properties of Eulerian graphs. Acta Math Acad Sci Hung 28:129\u2013138","journal-title":"Acta Math Acad Sci Hung"},{"issue":"2","key":"9405_CR15","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/s10878-007-9107-z","volume":"17","author":"N Vanetik","year":"2009","unstructured":"Vanetik N (2009) Path packing and a related optimization problem. J Comb Optim 17(2):192\u2013205","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9405-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9405-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-9405-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:15Z","timestamp":1559262195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9405-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,3]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9405"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9405-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,3]]}}}