{"id":"https://openalex.org/W4411319942","doi":"https://doi.org/10.1145/3717823.3718142","title":"Asymptotically Optimal Hardness for \ud835\udc58-Set Packing and \ud835\udc58-Matroid Intersection","display_name":"Asymptotically Optimal Hardness for \ud835\udc58-Set Packing and \ud835\udc58-Matroid Intersection","publication_year":2025,"publication_date":"2025-06-15","ids":{"openalex":"https://openalex.org/W4411319942","doi":"https://doi.org/10.1145/3717823.3718142"},"language":"en","primary_location":{"id":"doi:10.1145/3717823.3718142","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/251410","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["University of Michigan, Ann Harbor, USA"],"raw_orcid":"https://orcid.org/0000-0003-1454-7587","affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Harbor, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"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":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-2997-1372","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002961314","display_name":"Theophile Thiery","orcid":"https://orcid.org/0000-0002-1150-2386"},"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":false,"raw_author_name":"Theophile Thiery","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-1150-2386","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"54","last_page":"61"},"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.9995999932289124,"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.9995999932289124,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/matroid","display_name":"Matroid","score":0.8585492968559265},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.7772237658500671},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5660457015037537},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5171236991882324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4660298526287079},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.4386079013347626},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4166116714477539},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3627547025680542},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34265899658203125},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.287214994430542},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25200366973876953},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10638004541397095}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8585492968559265},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7772237658500671},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5660457015037537},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5171236991882324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4660298526287079},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.4386079013347626},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4166116714477539},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3627547025680542},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34265899658203125},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.287214994430542},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25200366973876953},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10638004541397095},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3717823.3718142","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3717823.3718142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/251410","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/251410","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/251410","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/251410","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},"sustainable_development_goals":[{"display_name":"Climate action","id":"https://metadata.un.org/sdg/13","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1482106463","https://openalex.org/W1582339485","https://openalex.org/W1607066202","https://openalex.org/W1966923282","https://openalex.org/W1975810219","https://openalex.org/W1980842804","https://openalex.org/W1998785385","https://openalex.org/W1999032440","https://openalex.org/W2001663593","https://openalex.org/W2030562672","https://openalex.org/W2035532007","https://openalex.org/W2087038607","https://openalex.org/W2091260378","https://openalex.org/W2094054391","https://openalex.org/W2097098285","https://openalex.org/W2140118062","https://openalex.org/W2179897858","https://openalex.org/W2514739098","https://openalex.org/W2901475388","https://openalex.org/W2963791077","https://openalex.org/W3138153684","https://openalex.org/W4281977994","https://openalex.org/W4287124252","https://openalex.org/W4316652443","https://openalex.org/W4316652470","https://openalex.org/W4386361324","https://openalex.org/W4399523282"],"related_works":["https://openalex.org/W2625145881","https://openalex.org/W2159059797","https://openalex.org/W2058489697","https://openalex.org/W2400862597","https://openalex.org/W1984819493","https://openalex.org/W4246417054","https://openalex.org/W2072414647","https://openalex.org/W4367050287","https://openalex.org/W2106233458","https://openalex.org/W1975978423"],"abstract_inverted_index":{"For":[0,63],"any":[1],"\ud835\udf00":[2],">":[3],"0,":[4],"we":[5,41,134],"prove":[6,135],"that":[7,136],"\ud835\udc58-Dimensional":[8,32],"Matching":[9,33],"is":[10,34],"hard":[11,145],"to":[12,95,128,146],"approximate":[13,147],"within":[14,148],"a":[15,35,44,73,96,101,115,149],"factor":[16,150],"of":[17,47,87,110],"\ud835\udc58/(12+\ud835\udf00)":[18],"for":[19,103,158],"large":[20],"\ud835\udc58":[21],"unless":[22],"NP":[23],"\u2286":[24],"BPP.":[25],"Listed":[26],"in":[27],"Karp\u2019s":[28],"21":[29],"NP-complete":[30],"problems,":[31,67],"benchmark":[36],"computational":[37],"complexity":[38],"problem":[39],"which":[40],"find":[42],"as":[43],"special":[45],"case":[46],"many":[48],"constrained":[49],"optimization":[50],"problems":[51],"over":[52,124,140],"independence":[53],"systems":[54],"including:":[55],"\ud835\udc58-Set":[56],"Packing,":[57],"\ud835\udc58-Matroid":[58],"Intersection,":[59],"and":[60,78,98],"Matroid":[61],"\ud835\udc58-Parity.":[62],"all":[64],"the":[65,68,104,132],"aforementioned":[66],"best-known":[69],"lower":[70],"bound":[71],"was":[72],"\u03a9(\ud835\udc58/log(\ud835\udc58))-hardness":[74],"by":[75],"Hazan,":[76],"Safra,":[77],"Schwartz.":[79],"In":[80],"contrast,":[81],"state-of-the-art":[82],"algorithms":[83],"achieve":[84],"an":[85],"approximation":[86,117],"\ud835\udc42(\ud835\udc58).":[88],"Our":[89],"result":[90,112],"narrows":[91],"down":[92],"this":[93],"gap":[94],"constant":[97],"thus":[99],"provides":[100],"rationale":[102],"observed":[105],"algorithmic":[106],"difficulties.":[107],"The":[108],"crux":[109],"our":[111],"hinges":[113],"on":[114],"novel":[116],"preserving":[118],"gadget":[119],"from":[120],"\ud835\udc45-degree":[121,137],"bounded":[122,138],"\ud835\udc58-CSPs":[123,139],"alphabet":[125,141],"size":[126,142],"\ud835\udc45":[127,143],"\ud835\udc58\ud835\udc45-Dimensional":[129],"Matching.":[130],"Along":[131],"way,":[133],"are":[144],"\u03a9\ud835\udc58":[151],"(\ud835\udc45)":[152],"using":[153],"known":[154],"randomised":[155],"sparsification":[156],"methods":[157],"CSPs.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}