{"id":"https://openalex.org/W4406142488","doi":"https://doi.org/10.1137/1.9781611978322.19","title":"The Submodular Santa Claus Problem","display_name":"The Submodular Santa Claus Problem","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4406142488","doi":"https://doi.org/10.1137/1.9781611978322.19"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978322.19","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978322.19","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://cris.maastrichtuniversity.nl/en/publications/41e2f7e9-f991-49a8-a6f6-a9af0fa7c16d","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007470040","display_name":"\u00c9tienne Bamas","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"\u00c9tienne Bamas","raw_affiliation_strings":["Post-Doctoral Fellow, ETH AI Center, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Post-Doctoral Fellow, ETH AI Center, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103305734","display_name":"Sarah Morell","orcid":null},"institutions":[{"id":"https://openalex.org/I87707601","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I87707601"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sarah Morell","raw_affiliation_strings":["TU Berlin, Germany. Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany\u2019s Excellence Strategy \u2014 The Berlin Mathematics Research Center MATH+ (EXC-2046/1, project ID: 390685689)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Berlin, Germany. Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany\u2019s Excellence Strategy \u2014 The Berlin Mathematics Research Center MATH+ (EXC-2046/1, project ID: 390685689)","institution_ids":["https://openalex.org/I87707601"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074555680","display_name":"Lars Rohwedder","orcid":"https://orcid.org/0000-0002-9434-4589"},"institutions":[{"id":"https://openalex.org/I4210164786","display_name":"Optimal Solutions (United States)","ror":"https://ror.org/05t1cnz26","country_code":"US","type":"company","lineage":["https://openalex.org/I4210164786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lars Rohwedder","raw_affiliation_strings":["Maastricht University, Netherlands. Supported by Dutch Research Council (NWO) project \u201cThe Twilight Zone of Efficiency: Optimality of Quasi-Polynomial Time Algorithms\u201d [grant number OCEN.W.21.268]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Maastricht University, Netherlands. Supported by Dutch Research Council (NWO) project \u201cThe Twilight Zone of Efficiency: Optimality of Quasi-Polynomial Time Algorithms\u201d [grant number OCEN.W.21.268]","institution_ids":["https://openalex.org/I4210164786"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00511852,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"616","last_page":"640"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13371","display_name":"Military Defense Systems Analysis","score":0.2935999929904938,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13371","display_name":"Military Defense Systems Analysis","score":0.2935999929904938,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.25619998574256897,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.6726832985877991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3683009743690491},{"id":"https://openalex.org/keywords/history","display_name":"History","score":0.3293647766113281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16385334730148315},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14007148146629333}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.6726832985877991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3683009743690491},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.3293647766113281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16385334730148315},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14007148146629333}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/1.9781611978322.19","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978322.19","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/41e2f7e9-f991-49a8-a6f6-a9af0fa7c16d","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/41e2f7e9-f991-49a8-a6f6-a9af0fa7c16d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bamas, \u00c9, Morell, S & Rohwedder, L 2025, The Submodular Santa Claus Problem. in Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ). vol. 1, Association for Computing Machinery, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 1, pp. 616-640, 36th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, Louisiana, United States, 12/01/25. https://doi.org/10.1137/1.9781611978322.19","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/41e2f7e9-f991-49a8-a6f6-a9af0fa7c16d","is_oa":true,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/41e2f7e9-f991-49a8-a6f6-a9af0fa7c16d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bamas, \u00c9, Morell, S & Rohwedder, L 2025, The Submodular Santa Claus Problem. in Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ). vol. 1, Association for Computing Machinery, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 1, pp. 616-640, 36th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, Louisiana, United States, 12/01/25. https://doi.org/10.1137/1.9781611978322.19","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W1989453388","https://openalex.org/W2922450688","https://openalex.org/W4313349366"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,14,26,44],"problem":[3,22,29],"of":[4],"allocating":[5],"indivisible":[6],"resources":[7],"to":[8,12,37],"players":[9],"so":[10],"as":[11],"maximize":[13],"minimum":[15],"total":[16],"value":[17],"any":[18],"player":[19],"receives.":[20],"This":[21],"is":[23],"sometimes":[24],"dubbed":[25],"Santa":[27],"Claus":[28],"and":[30],"its":[31],"different":[32],"variants":[33],"have":[34],"been":[35],"subject":[36],"extensive":[38],"research":[39],"towards":[40],"approximation":[41],"algorithms":[42],"over":[43],"past":[45],"two":[46],"decades.":[47]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}