{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:49:12Z","timestamp":1767340152153,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"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":"NWO","award":["OCEN.W.21.268"],"award-info":[{"award-number":["OCEN.W.21.268"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585174","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1862-1875","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Better Trees for Santa Claus"],"prefix":"10.1145","author":[{"given":"\u00c9tienne","family":"Bamas","sequence":"first","affiliation":[{"name":"EPFL, Switzerland"}]},{"given":"Lars","family":"Rohwedder","sequence":"additional","affiliation":[{"name":"Maastricht University, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1139175"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3070694"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229163.2229168"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of ICALP.","author":"Bamas Etienne","year":"2021","unstructured":"Etienne Bamas , Paritosh Garg , and Lars Rohwedder . 2021 . The Submodular Santa Claus Problem in the Restricted Assignment Case . In Proceedings of ICALP. Etienne Bamas, Paritosh Garg, and Lars Rohwedder. 2021. The Submodular Santa Claus Problem in the Restricted Assignment Case. In Proceedings of ICALP."},{"key":"e_1_3_2_1_5_1","volume-title":"Scheduling: Open problems old and new. Presentation at MAPSP","author":"Bansal Nikhil","year":"2017","unstructured":"Nikhil Bansal . 2017 . Scheduling: Open problems old and new. Presentation at MAPSP Nikhil Bansal. 2017. Scheduling: Open problems old and new. Presentation at MAPSP"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132522"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536488"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120680.1120683"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.51"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of SODA. 1087\u20131101","author":"Chakrabarty Deeparnab","year":"2014","unstructured":"Deeparnab Chakrabarty , Sanjeev Khanna , and Shi Li . 2014 . On (1,\u220a )-Restricted Assignment Makespan Minimization . In Proceedings of SODA. 1087\u20131101 . Deeparnab Chakrabarty, Sanjeev Khanna, and Shi Li. 2014. On (1,\u220a )-Restricted Assignment Makespan Minimization. In Proceedings of SODA. 1087\u20131101."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1042"},{"key":"e_1_3_2_1_12_1","first-page":"1","article-title":"Restricted Max-Min Fair Allocation","volume":"107","author":"Cheng Siu-Wing","year":"2018","unstructured":"Siu-Wing Cheng and Yuchen Mao . 2018 . Restricted Max-Min Fair Allocation . In Proceedings of ICALP. 107 , 37: 1 \u2013 37 :13. Siu-Wing Cheng and Yuchen Mao. 2018. Restricted Max-Min Fair Allocation. In Proceedings of ICALP. 107, 37:1\u201337:13.","journal-title":"Proceedings of ICALP."},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"Restricted Max-Min Allocation: Approximation and Integrality Gap","volume":"38","author":"Cheng Siu-Wing","year":"2019","unstructured":"Siu-Wing Cheng and Yuchen Mao . 2019 . Restricted Max-Min Allocation: Approximation and Integrality Gap . In Proceedings of ICALP. 38 : 1 \u2013 38 :13. Siu-Wing Cheng and Yuchen Mao. 2019. Restricted Max-Min Allocation: Approximation and Integrality Gap. In Proceedings of ICALP. 38:1\u201338:13.","journal-title":"Proceedings of ICALP."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.167"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9668-9"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of SODA. 287\u2013293","author":"Feige Uriel","year":"2008","unstructured":"Uriel Feige . 2008 . On allocations that maximize fairness . In Proceedings of SODA. 287\u2013293 . Uriel Feige. 2008. On allocations that maximize fairness. In Proceedings of SODA. 287\u2013293."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704445718"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780628"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch109"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01793010"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0314-4"},{"key":"e_1_3_2_1_23_1","first-page":"1","article-title":"Local Search Breaks 1.75 for Graph Balancing","volume":"74","author":"Jansen Klaus","year":"2019","unstructured":"Klaus Jansen and Lars Rohwedder . 2019 . Local Search Breaks 1.75 for Graph Balancing . In Proceedings of ICALP. 74 : 1 \u2013 74 :14. Klaus Jansen and Lars Rohwedder. 2019. Local Search Breaks 1.75 for Graph Balancing. In Proceedings of ICALP. 74:1\u201374:14.","journal-title":"Proceedings of ICALP."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M128257X"},{"key":"e_1_3_2_1_25_1","volume-title":"Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming, 46, 1","author":"Lenstra Jan Karel","year":"1990","unstructured":"Jan Karel Lenstra , David B Shmoys , and \u00c9va Tardos . 1990. Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming, 46, 1 ( 1990 ), 259\u2013271. Jan Karel Lenstra, David B Shmoys, and \u00c9va Tardos. 1990. Approximation algorithms for scheduling unrelated parallel machines. Mathematical programming, 46, 1 (1990), 259\u2013271."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818695"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/110851201"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-013-0359-4"},{"volume-title":"The design of approximation algorithms","author":"Williamson David P","key":"e_1_3_2_1_31_1","unstructured":"David P Williamson and David B Shmoys . 2011. The design of approximation algorithms . Cambridge university press . David P Williamson and David B Shmoys. 2011. The design of approximation algorithms. Cambridge university press."}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Orlando FL USA","acronym":"STOC '23"},"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.3585174","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:00Z","timestamp":1750178820000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":31,"alternative-id":["10.1145\/3564246.3585174","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585174","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"}}]}}