{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:10:10Z","timestamp":1752282610707},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319046563"},{"type":"electronic","value":"9783319046570"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-04657-0_9","type":"book-chapter","created":{"date-parts":[[2014,1,17]],"date-time":"2014-01-17T05:19:32Z","timestamp":1389935972000},"page":"68-79","source":"Crossref","is-referenced-by-count":5,"title":["A (k\u2009+\u20091)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Baffier","sequence":"first","affiliation":[]},{"given":"Vorapong","family":"Suppakitpaisarn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1955)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in O(nm) time, or better. In: Proc. STOC 2013, pp. 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"9_CR3","first-page":"1","volume":"53","author":"A. Bley","year":"1998","unstructured":"Bley, A., Gr\u00f6tschel, M., Wess\u00e4ly, R.: Design of broadband virtual private networks: Model and heuristics for the B-WiN. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a053, 1\u201316 (1998)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"9_CR4","unstructured":"Schwartz, M.: Telecommunication Networks: Protocols, Modeling and Analysis, vol.\u00a07. Addison-Wesley Reading (1987)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bagchi, A., Chaudhary, A., Scheideler, C., Kolman, P.: Algorithms for fault-tolerant routing in circuit switched networks. In: Proc. SPAA 2002, pp. 265\u2013274 (2002)","DOI":"10.1145\/564913.564915"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-39989-6_13","volume-title":"Distributed Computing","author":"A. Bagchi","year":"2003","unstructured":"Bagchi, A., Chaudhary, A., Goodrich, M.T., Xu, S.: Constructing disjoint paths for secure communication. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 181\u2013195. Springer, Heidelberg (2003)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2005.03.009","volume":"339","author":"A. Bagchi","year":"2005","unstructured":"Bagchi, A., Chaudhary, A., Kolman, P.: Short length Menger\u2019s theorem and reliable optical routing. Theoretical Computer Science\u00a0339(2), 315\u2013332 (2005)","journal-title":"Theoretical Computer Science"},{"key":"9_CR8","first-page":"1185","volume":"J-76-A","author":"W. Kishimoto","year":"1993","unstructured":"Kishimoto, W., Takeuchi, M.: On m-route flows in a network. IEICE Trans.\u00a0J-76-A, 1185\u20131200 (1993)","journal-title":"IEICE Trans."},{"issue":"4","key":"9_CR9","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\u00a027(4), 279\u2013291 (1996)","journal-title":"Networks"},{"key":"9_CR10","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":"9_CR11","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\u00a039(1), 43\u201352 (2002)","journal-title":"Networks"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1002\/net.20099","volume":"47","author":"D. Du","year":"2006","unstructured":"Du, D., Chandrasekaran, R.: The multiroute maximum flow problem revisited. Networks\u00a047(2), 81\u201392 (2006)","journal-title":"Networks"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/24.664001","volume":"46","author":"W. Kishimoto","year":"1997","unstructured":"Kishimoto, W.: Reliable flow with failures in a network. IEEE Transactions on Reliability\u00a046(3), 308\u2013315 (1997)","journal-title":"IEEE Transactions on Reliability"},{"key":"9_CR14","unstructured":"Lee, P.P., Misra, V., Rubenstein, D.: Distributed algorithms for secure multipath routing. In: Proc. INFOCOM 2005, vol.\u00a03, pp. 1952\u20131963 (2005)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Makarychev, Y., Vijayaraghavan, A., Zhou, Y.: Approximation algorithms and hardness of the k-route cut problem. In: Proc. SODA 2012, pp. 780\u2013799 (2012)","DOI":"10.1137\/1.9781611973099.63"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-540-70575-8_39","volume-title":"Automata, Languages and Programming","author":"C. Chekuri","year":"2008","unstructured":"Chekuri, C., Khanna, S.: Algorithms for 2-route cut problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 472\u2013484. Springer, Heidelberg (2008)"},{"key":"9_CR17","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 Applied Mathematics\u00a0143, 182\u2013193 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR18","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 Computer Communication Review\u00a029, 251\u2013262 (1999)","journal-title":"ACM SIGCOMM Computer Communication Review"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04657-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T23:48:53Z","timestamp":1558828133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04657-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319046563","9783319046570"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04657-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}