{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:21Z","timestamp":1781305041349,"version":"3.54.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_19","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:33:46Z","timestamp":1781303626000},"page":"282-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for\u00a0Minimizing Ordered Norms in\u00a0Fractional Load Balancing"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Blankenburg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonia","family":"Ellerbrock","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Kesselheim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Vygen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"19_CR1","unstructured":"Abernethy, J., Lee, C., Sinha, A., Tewari, A.: Online linear optimization via smoothing. In: Proceedings of the 27th Conference on Learning Theory, pp. 807\u2013823 (2014)"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"key":"19_CR3","unstructured":"Blankenburg, D.: Resource sharing revisited: local weak duality and optimal convergence. In: Proceedings of the 30th Annual European Symposium on Algorithms (2022)"},{"key":"19_CR4","unstructured":"Blankenburg, D., Ellerbrock, A., Kesselheim, T., Vygen, J.: An efficient algorithm for minimizing ordered norms in fractional load balancing (2025). https:\/\/arxiv.org\/abs\/2511.11237"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Braun, G., et al.: Conditional Gradient Methods: From Core Principles to AI Applications. SIAM (2025)","DOI":"10.1137\/1.9781611978568"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Swamy, C.: Approximation algorithms for minimum norm and ordered optimization problems. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 126\u2013137 (2019)","DOI":"10.1145\/3313276.3316322"},{"key":"19_CR8","unstructured":"Chakrabarty, D., Swamy, C.: Simpler and better algorithms for minimum-norm load balancing. In: 27th Annual European Symposium on Algorithms. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"issue":"12","key":"19_CR9","doi-asserted-by":"publisher","first-page":"3163","DOI":"10.1109\/TCAD.2018.2801231","volume":"37","author":"S Daboul","year":"2018","unstructured":"Daboul, S., H\u00e4hnle, N., Held, S., Schorr, U.: Provably fast and near-optimum gate sizing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(12), 3163\u20133176 (2018)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"5","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3587044","volume":"28","author":"S Daboul","year":"2023","unstructured":"Daboul, S., Held, S., Natura, B., Rotter, D.: Global interconnect optimization. ACM Trans. Design Autom. Electr. Syst. 28(5), 1\u201324 (2023)","journal-title":"ACM Trans. Design Autom. Electr. Syst."},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/0114053","volume":"14","author":"JM Danskin","year":"1966","unstructured":"Danskin, J.M.: The theory of max-min, with applications. SIAM J. Appl. Math. 14(4), 641\u2013664 (1966)","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"19_CR12","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."},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"19_CR14","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."},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/0804004","volume":"4","author":"MD Grigoriadis","year":"1994","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim. 4(1), 86\u2013107 (1994)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/TCAD.2017.2697964","volume":"37","author":"S Held","year":"2017","unstructured":"Held, S., M\u00fcller, D., Rotter, D., Scheifele, R., Traub, V., Vygen, J.: Global routing with timing constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(2), 406\u2013419 (2017)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"19_CR17","unstructured":"Helmbold, D.P., K\u00a0Warmuth, M.: Learning permutations with exponential weights. J. Mach. Learn. Res. 10(7), 1705\u20131736 (2009)"},{"key":"19_CR18","first-page":"281","volume":"1","author":"M Herbster","year":"2001","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best linear predictor. J. Mach. Learn. Res. 1, 281\u2013309 (2001)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-9260(01)00020-7","volume":"31","author":"J Hu","year":"2001","unstructured":"Hu, J., Sapatnekar, S.S.: A survey on multi-net global routing for integrated circuits. Integration 31(1), 1\u201349 (2001)","journal-title":"Integration"},{"key":"19_CR20","unstructured":"Ibrahimpur, S., Swamy, C.: Minimum-norm load balancing is (almost) as easy as minimizing makespan. In: 48th International Colloquium on Automata, Languages, and Programming. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"19_CR21","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In: Proceedings of the 30th International Conference on Machine Learning, pp. 427\u2013435 (2013)"},{"key":"19_CR22","unstructured":"Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 266\u2013274 (2003)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Kesselheim, T., Molinaro, M., Singla, S.: Online and bandit algorithms beyond $$\\ell _p$$ norms. In: Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1566\u20131593 (2023)","DOI":"10.1137\/1.9781611977554.ch58"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Kesselheim, T., Molinaro, M., Singla, S.: Supermodular approximation of norms and applications. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pp. 1841\u20131852 (2024)","DOI":"10.1145\/3618260.3649734"},{"issue":"4","key":"19_CR25","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1137\/12087222X","volume":"44","author":"P Klein","year":"2015","unstructured":"Klein, P., Young, N.E.: On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. SIAM J. Comput. 44(4), 1154\u20131172 (2015)","journal-title":"SIAM J. Comput."},{"key":"19_CR26","unstructured":"Koolen, W.M., Warmuth, M.K., Kivinen, J.: Hedging structured concepts. In: Proceedings of the 23rd Conference on Learning Theory, pp. 93\u2013105 (2010)"},{"key":"19_CR27","unstructured":"Lacoste-Julien, S., Jaggi, M., Schmidt, M., Pletscher, P.: Block-coordinate Frank-Wolfe optimization for structural SVMs. In: Proceedings of the 30th International Conference on Machine Learning, pp. 53\u201361 (2013)"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms, Cambridge University Press (2020)","DOI":"10.1017\/9781108571401"},{"key":"19_CR29","unstructured":"Lim, C.H., Wright, S.J.: Efficient Bregman projections onto the permutahedron and related polytopes. In: Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, pp. 1205\u20131213 (2016)"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Molinaro, M.: Online and random-order load balancing simultaneously. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1638\u20131650. SIAM (2017)","DOI":"10.1137\/1.9781611974782.108"},{"issue":"1","key":"19_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-011-0023-y","volume":"3","author":"D M\u00fcller","year":"2011","unstructured":"M\u00fcller, D., Radke, K., Vygen, J.: Faster min-max resource sharing in theory and practice. Math. Program. Comput. 3(1), 1\u201335 (2011)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"19_CR32","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"SA Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20(2), 257\u2013301 (1995)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"19_CR33","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1561\/2200000018","volume":"4","author":"S Shalev-Shwartz","year":"2012","unstructured":"Shalev-Shwartz, S.: Online learning and online convex optimization. Foundations Trends Mach. Learn. 4(2), 107\u2013194 (2012)","journal-title":"Foundations Trends Mach. Learn."},{"issue":"2","key":"19_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2566663","volume":"19","author":"Y Wei","year":"2014","unstructured":"Wei, Y., et al.: Techniques for scalable and effective routability evaluation. ACM Trans. Design Autom. Electr. Syst. 19(2), 1\u201337 (2014)","journal-title":"ACM Trans. Design Autom. Electr. Syst."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:33:53Z","timestamp":1781303633000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}