{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:51:37Z","timestamp":1725907897113},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662557501"},{"type":"electronic","value":"9783662557518"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-662-55751-8_21","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:32:49Z","timestamp":1502796769000},"page":"257-270","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of Routing with Few Collisions"],"prefix":"10.1007","author":[{"given":"Till","family":"Fluschnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Morik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-319-12691-3_23","volume-title":"Combinatorial Optimization and Applications","author":"Y Aoki","year":"2014","unstructured":"Aoki, Y., Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Ito, T., Konrad, C., Zhou, X.: The minimum vulnerability problem on graphs. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 299\u2013313. Springer, Cham (2014). doi:\n10.1007\/978-3-319-12691-3_23"},{"issue":"4","key":"21_CR2","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1007\/s00453-014-9927-z","volume":"70","author":"S Assadi","year":"2014","unstructured":"Assadi, S., Emamjomeh-Zadeh, E., Norouzi-Fard, A., Yazdanbod, S., Zarrabi-Zadeh, H.: The minimum vulnerability problem. Algorithmica 70(4), 718\u2013731 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"21_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P","volume":"28","author":"KA Berman","year":"1996","unstructured":"Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger\u2019s theorem. Networks 28(3), 125\u2013134 (1996)","journal-title":"Networks"},{"key":"21_CR4","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1999)"},{"key":"21_CR5","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Heidelberg (2013)"},{"key":"21_CR6","unstructured":"Fluschnik, T.: The Parameterized Complexity of Finding Paths with Shared Edges. Master thesis, Institut f\u00fcr Softwaretechnik und Theoretische Informatik, TU Berlin (2015). \nhttp:\/\/fpt.akt.tu-berlin.de\/publications\/theses\/MA-till-fluschnik.pdf"},{"key":"21_CR7","unstructured":"Fluschnik, T., Kratsch, S., Niedermeier, R., Sorge, M.: The parameterized complexity of the minimum shared edges problem. In: Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2015), LIPIcs, vol. 45, pp. 448\u2013462. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"21_CR8","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"issue":"4","key":"21_CR9","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"21_CR10","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). doi:\n10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"21_CR11","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-02094-0_9","volume-title":"Algorithmics of Large and Complex Networks","author":"E K\u00f6hler","year":"2009","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Skutella, M.: Traffic networks and flows over time. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 166\u2013196. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-02094-0_9"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-39212-2_57"},{"issue":"4","key":"21_CR14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"issue":"4","key":"21_CR15","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s10878-012-9462-2","volume":"26","author":"MT Omran","year":"2013","unstructured":"Omran, M.T., Sack, J., Zarrabi-Zadeh, H.: Finding paths with minimum shared edges. J. Comb. Optim. 26(4), 709\u2013722 (2013)","journal-title":"J. Comb. Optim."},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in \n            $$O(nm)$$\n           time, or better. In: Proceedings of the 45th ACM Symposium on Theory of Computing (STOC 2013), pp. 765\u2013774. ACM (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"21_CR17","doi-asserted-by":"crossref","DOI":"10.1201\/b18984","volume-title":"Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems","author":"H Rashidi","year":"2015","unstructured":"Rashidi, H., Tsang, E.: Vehicle Scheduling in Port Automation: Advanced Algorithms for Minimum Cost Flow Problems, 2nd edn. CRC Press, Boca Raton (2015)","edition":"2"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-76796-1_21","volume-title":"Research Trends in Combinatorial Optimization","author":"M Skutella","year":"2009","unstructured":"Skutella, M.: An introduction to network flows over time. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-540-76796-1_21"},{"key":"21_CR19","unstructured":"Ye, Z.Q., Li, Y.M., Lu, H.Q., Zhou, X.: Finding paths with minimum shared edges in graphs with bounded treewidths. In: Proceedings of the International Conference on Frontiers of Computer Science (FCS 2013), pp. 40\u201346 (2013)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55751-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:38:10Z","timestamp":1502797090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55751-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662557501","9783662557518"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55751-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}