{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:40:15Z","timestamp":1767138015095,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_3","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"26-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parametric Multiroute Flow and Its Application to Robust Network with $$k$$ Edge Failures"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Baffier","sequence":"first","affiliation":[]},{"given":"Vorapong","family":"Suppakitpaisarn","sequence":"additional","affiliation":[]},{"given":"Hidefumi","family":"Hiraishi","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"3_CR1","volume-title":"Flows in Networks","author":"LR Ford","year":"1955","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1955)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in $$O(nm)$$ time, or better. In: Proceedings of the STOC 2013, pp. 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<279::AID-NET3>3.0.CO;2-D","volume":"27","author":"W Kishimoto","year":"1996","unstructured":"Kishimoto, W.: A method for obtaining maximum multi-route flows in a network. Networks 27(4), 279\u2013291 (1996)","journal-title":"Networks"},{"key":"3_CR4","unstructured":"Bagchi, A., Chaudhary, A., Kolman, P., Sgall, J.: A simple combinatorial proof of duality of multiroute flows and cuts. Technical report, Charles Univ. (2004)"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1002\/net.10008","volume":"39","author":"C Aggarwal","year":"2002","unstructured":"Aggarwal, C., Orlin, J.B.: On multi-route maximums flows in networks. Networks 39(1), 43\u201352 (2002)","journal-title":"Networks"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-04657-0_9","volume-title":"Algorithms and Computation","author":"J-F Baffier","year":"2014","unstructured":"Baffier, J.-F., Suppakitpaisarn, V.: A (k + 1)-approximation robust network flow algorithm and a tighter heuristic method using iterative multiroute flow. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 68\u201379. Springer, Heidelberg (2014)"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11590-009-0116-y","volume":"3","author":"M Minoux","year":"2009","unstructured":"Minoux, M.: On robust maximum flow with polyhedral uncertainty sets. Optim. Lett. 3(3), 367\u2013376 (2009)","journal-title":"Optim. Lett."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Lee, P.P., Misra, V., Rubenstein, D.: Distributed algorithms for secure multipath routing. In: Proceedings of the INFOCOM 2005, vol. 3, pp. 1952\u20131963. IEEE (2005)","DOI":"10.1109\/INFCOM.2005.1498473"},{"issue":"5","key":"3_CR9","first-page":"776","volume":"81","author":"W Kishimoto","year":"1998","unstructured":"Kishimoto, W., Takeuchi, M.: A method for obtaining the maximum $$\\delta $$-reliable flow in a network. IEICE Trans. Fundam. 81(5), 776\u2013783 (1998)","journal-title":"IEICE Trans. Fundam."},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.endm.2009.11.011","volume":"35","author":"M Diallo","year":"2009","unstructured":"Diallo, M., Gueye, S., Berthom\u00e9, P.: Impact of a varying capacity on the all pairs $$2$$-route network flows. Electron. Notes Discrete Math. 35(3), 59\u201364 (2009)","journal-title":"Electron. Notes Discrete Math."},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/321978.321982","volume":"23","author":"MJ Eisner","year":"1976","unstructured":"Eisner, M.J., Severance, D.G.: Mathematical techniques for efficient record segmentation in large shared databases. JACM 23(4), 619\u2013635 (1976)","journal-title":"JACM"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Boykov, Y., Rother, C.: Applications of parametric maxflow in computer vision. In: Proceedings of the ICCV 2007, pp. 1\u20138 (2007)","DOI":"10.1109\/ICCV.2007.4408910"},{"issue":"15","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1016\/j.dam.2007.05.001","volume":"155","author":"YP Aneja","year":"2007","unstructured":"Aneja, Y.P., Chandrasekaran, R., Kabadi, S.N., Nair, K.: Flows over edge-disjoint mixed multipaths and applications. Discrete Appl. Math. 155(15), 1979\u20132000 (2007)","journal-title":"Discrete Appl. Math."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.dam.2004.02.014","volume":"143","author":"R Chandrasekaran","year":"2004","unstructured":"Chandrasekaran, R., Nair, K., Anejac, Y., Kabadib, S.: Multi-terminal multipath flows: synthesis. Discrete Appl. Math. 143, 182\u2013193 (2004)","journal-title":"Discrete Appl. Math."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Hulgeri, A., Sudarshan, S.: Parametric query optimization for linear and piecewise linear cost functions. In: Proceedings of the VLDB 2002, pp. 167\u2013178 (2002)","DOI":"10.1016\/B978-155860869-6\/50023-8"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"M Faloutsos","year":"1999","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. ACM SIGCOMM Comput. Commun. Rev. 29, 251\u2013262 (1999)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:51:39Z","timestamp":1746294699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":16,"aliases":["10.1007\/978-3-319-14115-2_3"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}