{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:54:11Z","timestamp":1777398851949,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-1844890"],"award-info":[{"award-number":["CCF-1844890"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585222","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"775-788","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse"],"prefix":"10.1145","author":[{"given":"Ravishankar","family":"Krishnaswamy","sequence":"first","affiliation":[{"name":"Microsoft Research, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi","family":"Li","sequence":"additional","affiliation":[{"name":"University at Buffalo, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Varun","family":"Suriyanarayana","sequence":"additional","affiliation":[{"name":"Cornell University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Ali Alakeel. 2009. A Guide to Dynamic Load Balancing in Distributed Computer Systems. International Journal of Computer Science and Network Security (IJCSNS) 10 (11 2009 ). \t\t\t\t  Ali Alakeel. 2009. A Guide to Dynamic Load Balancing in Distributed Computer Systems. International Journal of Computer Science and Network Security (IJCSNS) 10 (11 2009 )."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797324874"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/258128.258201"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1662"},{"key":"e_1_3_2_1_5_1","volume-title":"Karlin","author":"Azar Yossi","year":"1994","unstructured":"Yossi Azar , Andrei Z. Broder , and Anna R . Karlin . 1994 . On-Line Load Balancing. Theor. Comput. Sci . 130, 1 ( 1994 ), 73-84. Yossi Azar, Andrei Z. Broder, and Anna R. Karlin. 1994. On-Line Load Balancing. Theor. Comput. Sci. 130, 1 ( 1994 ), 73-84."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1008"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2022.03.007"},{"key":"e_1_3_2_1_8_1","volume-title":"A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theoretical Computer Science 380, 1 ( 2007 ), 87-99. https:\/\/doi.org\/10.1016\/j.tcs","author":"Gairing Martin","year":"2007","unstructured":"Martin Gairing , Burkhard Monien , and Andreas Woclaw . 2007. A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theoretical Computer Science 380, 1 ( 2007 ), 87-99. https:\/\/doi.org\/10.1016\/j.tcs . 2007 . 02.056 Automata, Languages and Programming . 10.1016\/j.tcs Martin Gairing, Burkhard Monien, and Andreas Woclaw. 2007. A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theoretical Computer Science 380, 1 ( 2007 ), 87-99. https:\/\/doi.org\/10.1016\/j.tcs. 2007. 02.056 Automata, Languages and Programming."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.35"},{"key":"e_1_3_2_1_10_1","article-title":"Improved Bounds for the Online Scheduling Problem","volume":"32","author":"Chandrasekaran John F.","year":"2003","unstructured":"John F. Rudin III and R. Chandrasekaran . 2003 . Improved Bounds for the Online Scheduling Problem . SIAM J. Comput. 32 , 3 ( 2003 ), 717-735. John F. Rudin III and R. Chandrasekaran. 2003. Improved Bounds for the Online Scheduling Problem. SIAM J. Comput. 32, 3 ( 2003 ), 717-735.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Jan Karel Lenstra David B Shmoys and \u00c9va Tardos. 1990. Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming 46 1 ( 1990 ) 259-271. \t\t\t\t  Jan Karel Lenstra David B Shmoys and \u00c9va Tardos. 1990. Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming 46 1 ( 1990 ) 259-271.","DOI":"10.1007\/BF01585745"},{"key":"e_1_3_2_1_12_1","first-page":"6523","volume-title":"Proceedings of the 38th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"139","author":"Li Shi","year":"2021","unstructured":"Shi Li and Jiayi Xian . 2021 . Online Unrelated Machine Load Balancing with Predictions Revisited . In Proceedings of the 38th International Conference on Machine Learning (Proceedings of Machine Learning Research , Vol. 139 ), Marina Meila and Tong Zhang (Eds.). PMLR , 6523 - 6532 . https:\/\/proceedings.mlr.press\/v139\/li21w. html Shi Li and Jiayi Xian. 2021. Online Unrelated Machine Load Balancing with Predictions Revisited. In Proceedings of the 38th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 139 ), Marina Meila and Tong Zhang (Eds.). PMLR, 6523-6532. https:\/\/proceedings.mlr.press\/v139\/li21w. html"},{"key":"e_1_3_2_1_13_1","first-page":"402","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing","author":"Steven","year":"1993","unstructured":"Steven J. Phillips and Jefery R. Westbrook. 1993. Online load balancing and network flow . In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing , May 16-18, 1993 , San Diego, CA, USA, S. Rao Kosaraju, David S. Johnson, and Alok Aggarwal (Eds.). ACM , 402 - 411 . Steven J. Phillips and Jefery R. Westbrook. 1993. Online load balancing and network flow. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, S. Rao Kosaraju, David S. Johnson, and Alok Aggarwal (Eds.). ACM, 402-411."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Peter Sanders Naveen Sivadasan and Martin Skutella. 2009. Online Scheduling with Bounded Migration. Math. Oper. Res. 34 2 ( 2009 ) 481-498. \t\t\t\t  Peter Sanders Naveen Sivadasan and Martin Skutella. 2009. Online Scheduling with Bounded Migration. Math. Oper. Res. 34 2 ( 2009 ) 481-498.","DOI":"10.1287\/moor.1090.0381"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3113606.3113856"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1074"},{"key":"e_1_3_2_1_17_1","volume-title":"Network flow algorithms","author":"Williamson David P","unstructured":"David P Williamson . 2019. Network flow algorithms . Cambridge University Press . David P Williamson. 2019. Network flow algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Received 2022-11-07; accepted 2023-02-06 \t\t\t\t  Received 2022-11-07; accepted 2023-02-06","DOI":"10.55242\/JPSW.2021.2202"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585222","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:01Z","timestamp":1750178821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":18,"alternative-id":["10.1145\/3564246.3585222","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585222","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}