{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:35:32Z","timestamp":1742934932119,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_2","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"14-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow"],"prefix":"10.1007","author":[{"given":"Kate\u0159ina","family":"Altmanov\u00e1","sequence":"first","affiliation":[]},{"given":"Petr","family":"Kolman","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Voborn\u00edk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"4","key":"2_CR1","first-page":"661","volume":"12","author":"J Ad\u00e1mek","year":"1971","unstructured":"Ad\u00e1mek, J., Koubek, V.: Remarks on flows in network with short paths. Comment. Math. Univ. Carolin. 12(4), 661\u2013667 (1971)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"2_CR2","unstructured":"Altmanov\u00e1, K.: Toky cestami omezen\u00e9 d\u00e9lky. Technical report, Bachelor\u2019s thesis, Charles University, Faculty of Mathematics and Physics, Department of Applied Mathematics (2018). (in Czech)"},{"key":"2_CR3","unstructured":"Baier, G.: Flows with path restrictions. Ph.D. thesis, TU Berlin (2003)"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1868237.1868241","volume":"7","author":"G Baier","year":"2010","unstructured":"Baier, G., et al.: Length-bounded cuts and flows. ACM Trans. Algorithms 7(1), 4:1\u20134:27 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bazgan, C., Fluschnik, T., Nichterlein, A., Niedermeier, R., Stahlberg, M.: A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. CoRR, abs\/1804.09155 (2018)","DOI":"10.1002\/net.21832"},{"issue":"3\u20134","key":"2_CR6","first-page":"131","volume":"12","author":"A Bley","year":"2003","unstructured":"Bley, A.: On the complexity of vertex-disjoint length-restricted path problems. Comput. Complex. 12(3\u20134), 131\u2013149 (2003)","journal-title":"Comput. Complex."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-13036-6_16","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Bley","year":"2010","unstructured":"Bley, A., Neto, J.: Approximability of 3- and 4-Hop bounded disjoint paths problems. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 205\u2013218. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13036-6_16"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-319-17142-5_37","volume-title":"Theory and Applications of Models of Computation","author":"P Dvo\u0159\u00e1k","year":"2015","unstructured":"Dvo\u0159\u00e1k, P., Knop, D.: Parametrized complexity of length-bounded cuts and multi-cuts. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 441\u2013452. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_37"},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/S0895480199355754","volume":"13","author":"LK Fleischer","year":"2000","unstructured":"Fleischer, L.K.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discret. Math. 13(4), 505\u2013520 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"2_CR10","unstructured":"Fluschnik, T., Hermelin, D., Nichterlein, A., Niedermeier, R.: Fractals for kernelization lower bounds, with an application to length-bounded cut problems. CoRR, abs\/1512.00333 (2015)"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1137\/S0097539704446232","volume":"37","author":"N Garg","year":"2007","unstructured":"Garg, N., K\u00f6nemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630\u2013652 (2007)","journal-title":"SIAM J. Comput."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Golovach, P.A., Thilikos, D.M.: Paths of bounded length and their cuts: parameterized complexity and algorithms. In: International Symposium on Parameterized and Exact Computation (2009)","DOI":"10.1007\/978-3-642-11269-0_17"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"GY Handler","year":"1980","unstructured":"Handler, G.Y., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10, 293\u2013310 (1980)","journal-title":"Networks"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17(1), 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2_CR15","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 12(3), 277\u2013286 (1982)","journal-title":"Networks"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7155\/jgaa.00462","volume":"22","author":"P Kolman","year":"2018","unstructured":"Kolman, P.: On algorithms employing treewidth for $${L}$$-bounded cut problems. J. Graph Algorithms Appl. 22, 177\u2013191 (2018)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jalgor.2004.07.006","volume":"61","author":"P Kolman","year":"2006","unstructured":"Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. J. Algorithms 61(1), 20\u201344 (2006)","journal-title":"J. Algorithms"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-10856-4_106","volume-title":"Mathematical Foundations of Computer Science 1981","author":"V Koubek","year":"1981","unstructured":"Koubek, V., \u0158\u00edha, A.: The maximum k-flow in a network. In: Gruska, J., Chytil, M. (eds.) MFCS 1981. LNCS, vol. 118, pp. 389\u2013397. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10856-4_106"},{"key":"2_CR19","unstructured":"Lee, E.: Improved hardness for cut, interdiction, and firefighter problems. In: International Colloquium on Automata Languages, and Programming (2017)"},{"issue":"5","key":"2_CR20","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5), 213\u2013219 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"2_CR21","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10107-010-0366-6","volume":"124","author":"RA Mahjoub","year":"2010","unstructured":"Mahjoub, R.A., McCormick, T.S.: Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation. Math. Program. 124(1\u20132), 271\u2013284 (2010)","journal-title":"Math. Program."},{"key":"2_CR22","unstructured":"Schieber, B., Bar-Noy, A., Khuller, S.: The complexity of finding most vital arcs and nodes. Technical report, College Park, MD, USA (1995)"},{"key":"2_CR23","unstructured":"Voborn\u00edk, J.: Algorithms for $${L}$$-bounded flows. Master\u2019s thesis, Charles University, Faculty of Mathematics and Physics, Department of Applied Mathematics (2016)"},{"key":"2_CR24","unstructured":"Zschoche, P., Fluschnik, T., Molter, H., Niedermeier, R.: The computational complexity of finding separators in temporal graphs. ArXiv e-prints, November 2017"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:52:43Z","timestamp":1710265963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}