{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:59Z","timestamp":1759063499150},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130724"},{"type":"electronic","value":"9783642130731"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13073-1_31","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T08:09:58Z","timestamp":1273478998000},"page":"347-358","source":"Crossref","is-referenced-by-count":3,"title":["Capacitated Confluent Flows: Complexity and Algorithms"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Dressler","sequence":"first","affiliation":[]},{"given":"Martin","family":"Strehler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"key":"31_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Single-source unsplittable flow. In: 37th Annual Symposium on Foundations of Computer Science, pp. 68\u201377 (1996)","DOI":"10.1109\/SFCS.1996.548465"},{"key":"31_CR4","unstructured":"Bley, A.: Routing and Capacity Optimization for IP Networks. PhD thesis, TU Berlin (2007)"},{"key":"31_CR5","unstructured":"F\u00fcgenschuh, A., Homfeld, H., Schuelldorf, H.: Routing cars in rail freight service. Dagstuhl Seminar Proceedings, vol.\u00a009261, Dagstuhl, Germany (2009)"},{"key":"31_CR6","first-page":"443","volume-title":"STOC 2008: Proceedings of the 40th annual ACM symposium on Theory of computing","author":"N. Goyal","year":"2008","unstructured":"Goyal, N., Olver, N., Shepherd, F.B.: The VPN conjecture is true. In: STOC 2008: Proceedings of the 40th annual ACM symposium on Theory of computing, pp. 443\u2013450. ACM, New York (2008)"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.jcss.2005.09.009","volume":"72","author":"J. Chen","year":"2006","unstructured":"Chen, J., Rajaraman, R., Sundaram, R.: Meet and merge: approximation algorithms for confluent flows. J. Comput. Syst. Sci.\u00a072, 468\u2013489 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1255443.1255444","volume":"54","author":"J. Chen","year":"2007","unstructured":"Chen, J., Kleinberg, R.D., Lov\u00e1sz, L., Rajaraman, R., Sundaram, R., Vetta, A.: (Almost) tight bounds and existence theorems for single-commodity confluent flows. J. ACM\u00a054, 16 (2007)","journal-title":"J. ACM"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H. Bodlaender","year":"1997","unstructured":"Bodlaender, H.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 29\u201336. Springer, Heidelberg (1997)"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science\u00a010, 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"key":"31_CR11","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jctb.2000.2031","volume":"82","author":"T. Johnson","year":"2001","unstructured":"Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. Journal of Combinatorial Theory, Series B\u00a082, 138\u2013154 (2001)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"31_CR13","unstructured":"Kaibel, V., Peinhardt, M.A.F.: On the bottleneck shortest path problem. Technical Report 06-22, Konrad-Zuse-Zentrum f. Informationstechnik Berlin (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T01:37:17Z","timestamp":1552527437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}