{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:54:39Z","timestamp":1767138879269,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":21,"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_1","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximum Throughput Network Routing Subject to Fair Flow Allocation"],"prefix":"10.1007","author":[{"given":"Edoardo","family":"Amaldi","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Coniglio","sequence":"additional","affiliation":[]},{"given":"Leonardo","family":"Taccari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-30193-6_28","volume-title":"Quality of Service in the Emerging Networking Panorama","author":"M Allalouf","year":"2004","unstructured":"Allalouf, M., Shavitt, Y.: Maximum flow routing with weighted max-min fairness. In: Sol\u00e9-Pareta, J., Smirnov, M., Van Mieghem, P., Domingo-Pascual, J., Monteiro, E., Reichl, P., Stiller, B., Gibbens, R.J. (eds.) QofIS 2004. LNCS, vol. 3266, pp. 278\u2013287. Springer, Heidelberg (2004)"},{"issue":"7","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1109\/LCOMM.2013.060513.130351","volume":"17","author":"E Amaldi","year":"2013","unstructured":"Amaldi, E., Capone, A., Coniglio, S., Gianoli, L.G.: Network optimization problems subject to max-min fair flow allocation. IEEE Commun. Lett. 17(7), 1463\u20131466 (2013)","journal-title":"IEEE Commun. Lett."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.endm.2013.05.136","volume":"41","author":"E Amaldi","year":"2013","unstructured":"Amaldi, E., Coniglio, S., Gianoli, L.G., Ileri, C.U.: On single-path network routing subject to max-min fair flow allocation. Electron. Notes Discrete Math. 41, 543\u2013550 (2013)","journal-title":"Electron. Notes Discrete Math."},{"issue":"5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s00493-010-2455-9","volume":"30","author":"M Andrews","year":"2010","unstructured":"Andrews, M., Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K., Zhang, L.: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica 30(5), 485\u2013520 (2010)","journal-title":"Combinatorica"},{"key":"1_CR5","volume-title":"Data Networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Upper Saddle River (1992)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Danna, E., Hassidim, A., Kaplan, H., Kumar, A., Mansour, Y., Raz, D., Segalov, M.: Upward max min fairness. In: Proceedings IEEE INFOCOM 2012, pp. 837\u2013845, March 2012","DOI":"10.1109\/INFCOM.2012.6195832"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Danna, E., Mandal, S., Singh, A.: A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering. In: Proceedings IEEE INFOCOM 2012, pp. 846\u2013854, March 2012","DOI":"10.1109\/INFCOM.2012.6195833"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10(2), 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Harks, T., Hoefer, M., Schewior, K., Skopalik, A.: Routing games with progressive filling. CoRR abs\/1308.3161, abs\/1308.3161 (2013)","DOI":"10.1109\/INFOCOM.2014.6847957"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Rabani, Y., Tardos, \u00c9.: Fairness in routing and load balancing. In: 40th Annual Symposium on Foundations of Computer Science (FOCS), pp. 568\u2013578. IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814631"},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1109\/TNET.2002.1012364","volume":"10","author":"L Massouli\u00e9","year":"2002","unstructured":"Massouli\u00e9, L., Roberts, J.: Bandwidth sharing: objectives and algorithms. IEEE\/ACM Trans. Netw. 10(3), 320\u2013328 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01585506","volume":"7","author":"N Megiddo","year":"1974","unstructured":"Megiddo, N.: Optimal flows in networks with multiple sources and sinks. Math. Program. 7(1), 97\u2013107 (1974)","journal-title":"Math. Program."},{"issue":"4","key":"1_CR13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/SURV.2008.080403","volume":"10","author":"D Nace","year":"2008","unstructured":"Nace, D., Pi\u00f3ro, M.: Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial. Commun. Surv. Tutorials 10(4), 5\u201317 (2008)","journal-title":"Commun. Surv. Tutorials"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.cor.2006.03.020","volume":"35","author":"D Nace","year":"2008","unstructured":"Nace, D., Doan, N.L., Klopfenstein, O., Bashllari, A.: Max-min fairness in multi-commodity flows. Comput. Oper. Res. 35(2), 557\u2013573 (2008)","journal-title":"Comput. Oper. Res."},{"key":"1_CR15","unstructured":"Nilsson, P.: Fairness in communication and computer network design. Ph.D. thesis, Lund University, Sweden (2006)"},{"issue":"3","key":"1_CR16","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S Orlowski","year":"2010","unstructured":"Orlowski, S., Wess\u00e4ly, R., Pi\u00f3ro, M., Tomaszewski, A.: SNDlib 1.0 - survivable network design library. Networks 55(3), 276\u2013286 (2010)","journal-title":"Networks"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Pioro, M.: Fair routing and related optimization problems. In: International Conference on Advanced Computing and Communications (ADCOM), pp. 229\u2013235. IEEE (2007)","DOI":"10.1109\/ADCOM.2007.140"},{"issue":"5","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1109\/TNET.2007.896231","volume":"15","author":"B Radunovic","year":"2007","unstructured":"Radunovic, B., Boudec, J.Y.L.: A unified framework for max-min and min-max fairness with applications. IEEE\/ACM Trans. Netw. 15(5), 1073\u20131083 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/j.ejor.2006.12.047","volume":"185","author":"RM Salles","year":"2008","unstructured":"Salles, R.M., Barria, J.A.: Lexicographic maximin optimisation for fair bandwidth allocation in computer networks. Eur. J. Oper. Res. 185(2), 778\u2013794 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/ett.1047","volume":"16","author":"A Tomaszewski","year":"2005","unstructured":"Tomaszewski, A.: A polynomial algorithm for solving a general max-min fairness problem. Eur. Trans. Telecommun. 16(3), 233\u2013240 (2005)","journal-title":"Eur. Trans. Telecommun."},{"key":"1_CR21","unstructured":"Wong, R.: Integer programming formulations of the travelling salesman problem. In: Proceedings IEEE Conference on Circuits and Computers, pp. 149\u2013152 (1980)"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:51:40Z","timestamp":1746294700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":21,"aliases":["10.1007\/978-3-319-14115-2_1"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_1","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"}}]}}