{"id":"https://openalex.org/W4376639601","doi":"https://doi.org/10.1145/3564246.3585174","title":"Better Trees for Santa Claus","display_name":"Better Trees for Santa Claus","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639601","doi":"https://doi.org/10.1145/3564246.3585174"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585174","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/204330","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/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"\u00c9tienne Bamas","raw_affiliation_strings":["EPFL, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"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/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Lars Rohwedder","raw_affiliation_strings":["Maastricht University, Netherlands"],"affiliations":[{"raw_affiliation_string":"Maastricht University, Netherlands","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007470040"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":0.4034,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62889922,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1862","last_page":"1875"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.7683037519454956},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6238948106765747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6048015356063843},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.593021810054779},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5316821932792664},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5313960313796997},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45139241218566895},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.43721893429756165},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37604743242263794},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.14031344652175903}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7683037519454956},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6238948106765747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6048015356063843},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.593021810054779},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5316821932792664},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5313960313796997},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45139241218566895},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.43721893429756165},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37604743242263794},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.14031344652175903},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3564246.3585174","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:publications/e85db420-4085-497f-8879-4b9d04c68cbd","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/e85db420-4085-497f-8879-4b9d04c68cbd","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bamas, \u00c9 & Rohwedder, L 2023, Better Trees for Santa Claus. in B Saha & R A Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 1862-1875, 55th Annual ACM Symposium on Theory of Computing, Orlando, Florida, United States, 20/06/23. https://doi.org/10.1145/3564246.3585174","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:infoscience.epfl.ch:308219","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/204330","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:308219","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/204330","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"WoS","raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1589729468","https://openalex.org/W1605794186","https://openalex.org/W1978593916","https://openalex.org/W2001927417","https://openalex.org/W2006905044","https://openalex.org/W2009976792","https://openalex.org/W2042587503","https://openalex.org/W2068859584","https://openalex.org/W2081855231","https://openalex.org/W2084415648","https://openalex.org/W2093066443","https://openalex.org/W2109693504","https://openalex.org/W2123976299","https://openalex.org/W2135932424","https://openalex.org/W2154014787","https://openalex.org/W2168581227","https://openalex.org/W2295961103","https://openalex.org/W2607924865","https://openalex.org/W2798755896","https://openalex.org/W2946212062","https://openalex.org/W2981057370","https://openalex.org/W3003074572","https://openalex.org/W3095593924","https://openalex.org/W4205585032","https://openalex.org/W4301431519","https://openalex.org/W4316652395","https://openalex.org/W6750721353","https://openalex.org/W6755628119"],"related_works":["https://openalex.org/W4309048849","https://openalex.org/W3164898278","https://openalex.org/W4319988133","https://openalex.org/W2951456395","https://openalex.org/W2365230865","https://openalex.org/W1997341083","https://openalex.org/W4282568420","https://openalex.org/W2900136945","https://openalex.org/W2037065294","https://openalex.org/W4297538187"],"abstract_inverted_index":{"We":[0,166,242],"revisit":[1],"the":[2,21,36,60,71,96,99,106,110,133,144,148,179,185,192,197,205,210,270,273,294,297],"problem":[3,38,84,109,136,151],"max-min":[4,154,180],"degree":[5,155,181],"arborescence,":[6],"which":[7,26,252,288],"was":[8,129],"introduced":[9],"by":[10,125,256],"Bateni":[11,126,257],"et":[12,127,138,258],"al.":[13,128,139],"[STOC\u201909]":[14],"as":[15],"a":[16,28,42,114,160,173,201,235,244,282],"central":[17],"special":[18,202],"case":[19,120,203],"of":[20,68,86,95,98,187,195,204,220,247,287,296],"general":[22],"Santa":[23,100,107,134,149,206],"Claus":[24,101,108,135,150,207],"problem,":[25,208],"constitutes":[27],"notorious":[29],"open":[30],"question":[31],"in":[32,59,105,118,163,175,269,293],"approximation":[33,162],"algorithms.":[34],"In":[35,272],"former":[37],"we":[39,228,264,275],"are":[40,223],"given":[41],"directed":[43],"graph":[44],"with":[45],"sources":[46,61],"and":[47,49,121,152,157,249,281],"sinks":[48],"our":[50,188,221],"goal":[51],"is":[52,73,79,85,191],"to":[53,80,92,132,171,233],"find":[54,234],"vertex":[55,67],"disjoint":[56],"arborescences":[57],"rooted":[58],"such":[62],"that":[63,230,237],"at":[64,74],"each":[65],"non-sink":[66],"an":[69,168],"arborescence":[70,156,182],"out-degree":[72],"least":[75],"k,":[76],"where":[77,209],"k":[78],"be":[81,214],"maximized.":[82],"This":[83],"particular":[87],"interest,":[88],"since":[89],"it":[90,231],"appears":[91],"capture":[93],"much":[94],"difficulty":[97],"problem:":[102],"(1)":[103],"like":[104],"configuration":[111,211,298],"LP":[112,212,248],"has":[113,239],"large":[115],"integrality":[116],"gap":[117],"this":[119,190],"(2)":[122],"previous":[123,262],"progress":[124],"quickly":[130],"generalized":[131],"(Chakrabarty":[137],"[FOCS\u201909]).":[140],"These":[141],"results":[142],"remain":[143],"state-of-the-art":[145],"both":[146,286],"for":[147,153,178,200],"they":[158],"yield":[159],"polylogarithmic":[161],"quasi-polynomial":[164,176],"time.":[165],"present":[167],"exponential":[169],"improvement":[170],"this,":[172],"poly(loglogn)-approximation":[174],"time":[177],"problem.":[183],"To":[184],"best":[186],"knowledge,":[189],"first":[193],"example":[194],"breaking":[196],"logarithmic":[198],"barrier":[199],"cannot":[213],"utilized.":[215],"The":[216],"main":[217],"technical":[218],"novelty":[219],"result":[222],"locally":[224,238],"good":[225],"solutions:":[226],"informally,":[227],"show":[229],"suffices":[232],"poly(logn)-approximation":[236],"stronger":[240],"guarantees.":[241],"use":[243],"lift-and-project":[245],"type":[246],"randomized":[250],"rounding,":[251],"were":[253,289],"also":[254],"used":[255,291],"al.,":[259],"but":[260],"unlike":[261],"work":[263],"integrate":[265],"careful":[266],"pruning":[267],"steps":[268],"rounding.":[271],"proof":[274],"extensively":[276],"apply":[277],"Lov\u00e1sz":[278],"Local":[279],"Lemma":[280],"local":[283],"search":[284],"technique,":[285],"previously":[290],"only":[292],"context":[295],"LP.":[299]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}