{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T16:45:18Z","timestamp":1790009118177,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_59","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"679-690","source":"Crossref","is-referenced-by-count":15,"title":["Length-Bounded Cuts and Flows"],"prefix":"10.1007","author":[{"given":"Georg","family":"Baier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Erlebach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Hall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ekkehard","family":"K\u00f6hler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heiko","family":"Schilling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Menger, K.: Zur allgemeinen Kurventheorie. Fund. Mathematicae, 96\u2013115 (1927)","DOI":"10.4064\/fm-10-1-96-115"},{"key":"59_CR2","series-title":"Annals of Math. Studies","first-page":"215","volume-title":"Linear Inequalities and Related Systems","author":"G.B. Dantzig","year":"1956","unstructured":"Dantzig, G.B., Fulkerson, D.R.: On the max flow min cut theorem of networks. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems. Annals of Math. Studies, vol.\u00a038, pp. 215\u2013221. Princeton University Press, Princeton (1956)"},{"key":"59_CR3","unstructured":"Kotzig, A.: Connectivity and Regular Connectivity of Finite Graphs. PhD thesis, Vysok\u00e1 \u0160kola Ekonomick\u00e1, Bratislava, Slovakia (1956)"},{"key":"59_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"9","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics\u00a09, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"key":"59_CR5","doi-asserted-by":"crossref","unstructured":"Elias, P., Feinstein, A., Shannon, C.E.: A note on the maximum flow through a network. IRE Transactions on Information Theory 2 (1956)","DOI":"10.1109\/TIT.1956.1056816"},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02019432","volume":"9","author":"L. Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L., Neumann Lara, V., Plummer, M.D.: Mengerian theorems for paths of bounded length. Periodica Mathematica Hungarica\u00a09, 269\u2013276 (1978)","journal-title":"Periodica Mathematica Hungarica"},{"key":"59_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0012-365X(83)90197-8","volume":"44","author":"G. Exoo","year":"1983","unstructured":"Exoo, G.: On line disjoint paths of bounded length. Discrete Mathematics\u00a044, 317\u2013318 (1983)","journal-title":"Discrete Mathematics"},{"key":"59_CR8","first-page":"275","volume":"42","author":"L. Niepel","year":"1983","unstructured":"Niepel, L., Safar\u00edkov\u00e1, D.: On a generalization of Menger\u2019s Theorem. Acta Mathematica Universitatis Comenianae\u00a042, 275\u2013284 (1983)","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"59_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.: Graph Theory with Applications. North-Holland, Amsterdam (1976)"},{"key":"59_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/jgt.3190060215","volume":"6","author":"S.M. Boyles","year":"1982","unstructured":"Boyles, S.M., Exoo, G.: A counterexample to a conjecture on paths of bounded length. Journal of Graph Theory\u00a06, 205\u2013209 (1982)","journal-title":"Journal of Graph Theory"},{"key":"59_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"12","author":"A. Itai","year":"1982","unstructured":"Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks\u00a012, 277\u2013286 (1982)","journal-title":"Networks"},{"key":"59_CR12","first-page":"19","volume-title":"Proceedings of the Symposium on Theory of Computing","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings of the Symposium on Theory of Computing, pp. 19\u201328. ACM, New York (1999)"},{"key":"59_CR13","unstructured":"Baier, G.: Flows with Path Restrictions. PhD thesis, TU Berlin, Germany (2003)"},{"key":"59_CR14","unstructured":"Mahjoub, A.R., McCormick, S.T.: The complexity of max flow and min cut with bounded-length paths. unpublished Manuscript (2003)"},{"key":"59_CR15","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1002\/net.3230140405","volume":"14","author":"Y. Perl","year":"1984","unstructured":"Perl, Y., Ronen, D.: Heuristics for finding a maximum number of disjoint bounded paths. Networks\u00a014, 531\u2013544 (1984)","journal-title":"Networks"},{"key":"59_CR16","unstructured":"Brandes, U., Neyer, G., Wagner, D.: Edge-disjoint paths in planar graphs with short total length. Technical Report\u00a019, Universit\u00e4t Konstanz (1996)"},{"issue":"1","key":"59_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01294465","volume":"15","author":"D. Wagner","year":"1995","unstructured":"Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica\u00a015(1), 135\u2013150 (1995)","journal-title":"Combinatorica"},{"key":"59_CR18","unstructured":"Hsu, D.: On container width and length in graphs, groups, and networks. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E77-A(4) (1994)"},{"key":"59_CR19","unstructured":"Kolman, P.: Personal communication (2006)"},{"issue":"1","key":"59_CR20","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics\u00a0162(1), 439\u2013486 (2005)","journal-title":"Annals of Mathematics"},{"key":"59_CR21","first-page":"499","volume-title":"Proceedings of the Symposium on Theory of Computing","author":"Z. Galil","year":"1995","unstructured":"Galil, Z., Yu, X.: Short length versions of Menger\u2019s Theorem. In: Proceedings of the Symposium on Theory of Computing, pp. 499\u2013508. ACM, New York (1995)"},{"key":"59_CR22","unstructured":"Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proceedings of the Symposium on Discrete Algorithms, pp. 184\u2013193 (2002)"},{"key":"59_CR23","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Fast, fair, and efficient flows in networks. In: Operations Research, INFORMS (to appear, 2006)"},{"key":"59_CR24","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:33:06Z","timestamp":1558294386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11786986_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}