{"id":"https://openalex.org/W2620998635","doi":"https://doi.org/10.1145/3459668","title":"The Quest for Strong Inapproximability Results with Perfect Completeness","display_name":"The Quest for Strong Inapproximability Results with Perfect Completeness","publication_year":2021,"publication_date":"2021-07-15","ids":{"openalex":"https://openalex.org/W2620998635","doi":"https://doi.org/10.1145/3459668","mag":"2620998635"},"language":"en","primary_location":{"id":"doi:10.1145/3459668","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3459668","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3459668","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3459668","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Brakensiek","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00249355,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"17","issue":"3","first_page":"1","last_page":"35"},"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.9861999750137329,"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.9861999750137329,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9793999791145325,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9513999819755554,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8376753330230713},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7501867413520813},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6797874569892883},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6187428832054138},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5967296957969666},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.5671972036361694},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5496429800987244},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.5417860150337219},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5376737117767334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.481748104095459},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.47314679622650146},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.4465465843677521},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42658984661102295},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4169315695762634},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3307282626628876},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.2868371605873108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18680346012115479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12049797177314758}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8376753330230713},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7501867413520813},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6797874569892883},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6187428832054138},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5967296957969666},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.5671972036361694},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5496429800987244},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.5417860150337219},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5376737117767334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.481748104095459},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.47314679622650146},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.4465465843677521},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42658984661102295},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4169315695762634},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3307282626628876},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2868371605873108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18680346012115479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12049797177314758},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3459668","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3459668","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3459668","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:7553","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.4","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"mag:2620998635","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc24.html#BrakensiekG17","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electron. Colloquium Comput. Complex.","raw_type":null},{"id":"mag:2747410788","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/approx/approx2017.html#BrakensiekG17","pdf_url":null,"source":{"id":"https://openalex.org/S4306420261","display_name":"International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3459668","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3459668","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3459668","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4143485563","display_name":null,"funder_award_id":"CCF-1422045,CCF-1526092,CCF-1908125,NSF GRFP","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5082161757","display_name":"AF: Small: The Polymorphic Gateway between Structure and Algorithms: Beyond CSP Dichotomy","funder_award_id":"1908125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5200908636","display_name":"CIF/AF: Small: Some fundamental complexity-inspired coding theory challenges","funder_award_id":"1422045","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6688699574","display_name":"AF: Small: Approximate optimization: Algorithms, Hardness, and Integrality Gaps","funder_award_id":"1526092","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7976889051","display_name":null,"funder_award_id":"CCF-1908125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8320020307","display_name":null,"funder_award_id":"CCF-1526092","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2620998635.pdf","grobid_xml":"https://content.openalex.org/works/W2620998635.grobid-xml"},"referenced_works_count":58,"referenced_works":["https://openalex.org/W122014950","https://openalex.org/W573138702","https://openalex.org/W1859357731","https://openalex.org/W1936868491","https://openalex.org/W1969999211","https://openalex.org/W1973898585","https://openalex.org/W1979065044","https://openalex.org/W1992866589","https://openalex.org/W1995228946","https://openalex.org/W1999032440","https://openalex.org/W2001765616","https://openalex.org/W2003464009","https://openalex.org/W2008724760","https://openalex.org/W2018582985","https://openalex.org/W2023691706","https://openalex.org/W2027210158","https://openalex.org/W2027607915","https://openalex.org/W2038663599","https://openalex.org/W2047861934","https://openalex.org/W2055711302","https://openalex.org/W2056590617","https://openalex.org/W2064035344","https://openalex.org/W2078929687","https://openalex.org/W2087038607","https://openalex.org/W2091891568","https://openalex.org/W2091921997","https://openalex.org/W2097098285","https://openalex.org/W2100780780","https://openalex.org/W2104254886","https://openalex.org/W2106478922","https://openalex.org/W2107327484","https://openalex.org/W2110871651","https://openalex.org/W2125534993","https://openalex.org/W2126331452","https://openalex.org/W2137118456","https://openalex.org/W2152490496","https://openalex.org/W2154276597","https://openalex.org/W2165967486","https://openalex.org/W2170862660","https://openalex.org/W2179897858","https://openalex.org/W2397159611","https://openalex.org/W2400082414","https://openalex.org/W2514739098","https://openalex.org/W2559529531","https://openalex.org/W2591560904","https://openalex.org/W2610340222","https://openalex.org/W2621263703","https://openalex.org/W2625369867","https://openalex.org/W2625656873","https://openalex.org/W2747410788","https://openalex.org/W2775735346","https://openalex.org/W2809286765","https://openalex.org/W2809340088","https://openalex.org/W2949537674","https://openalex.org/W2963631653","https://openalex.org/W2963950837","https://openalex.org/W3004384893","https://openalex.org/W3037538996"],"related_works":["https://openalex.org/W3185022466","https://openalex.org/W2911327865","https://openalex.org/W2102107640","https://openalex.org/W2000151313","https://openalex.org/W573138702","https://openalex.org/W3167416129","https://openalex.org/W2400433437","https://openalex.org/W2953223971","https://openalex.org/W2268446019","https://openalex.org/W3196550748","https://openalex.org/W2967917758","https://openalex.org/W2951762341","https://openalex.org/W3183451329","https://openalex.org/W2296260535","https://openalex.org/W2514739098","https://openalex.org/W1619463472","https://openalex.org/W2010996873","https://openalex.org/W2154297841","https://openalex.org/W2566277476","https://openalex.org/W2400026830"],"abstract_inverted_index":{"The":[0],"Unique":[1,53],"Games":[2,54],"Conjecture":[3],"has":[4,204,248],"pinned":[5],"down":[6],"the":[7,23,47,52,61,68,101,121,133,176],"approximability":[8,69],"of":[9,63,67,70,74,83,103,107,123,154,175,212,256],"all":[10,188,231],"constraint":[11],"satisfaction":[12],"problems":[13],"(CSPs),":[14],"showing":[15],"that":[16,41,78,110,145],"a":[17,64,90,104,118,151,180,223],"natural":[18],"semidefinite":[19],"programming":[20],"relaxation":[21],"offers":[22],"optimal":[24],"worst-case":[25],"approximation":[26],"ratio":[27],"for":[28,38,146,187,230],"any":[29],"CSP.":[30],"This":[31,56],"elegant":[32],"picture,":[33],"however,":[34],"does":[35],"not":[36],"apply":[37],"CSP":[39],"instances":[40,73],"are":[42],"perfectly":[43,71,128],"satisfiable,":[44],"due":[45],"to":[46,161,195,238],"imperfect":[48],"completeness":[49],"inherent":[50],"in":[51],"Conjecture.":[55],"work":[57],"is":[58,100,138,159,193,199,236,242],"motivated":[59],"by":[60],"pursuit":[62],"better":[65],"understanding":[66],"satisfiable":[72,94,129,152],"CSPs.":[75],"We":[76],"prove":[77,132],"an":[79,139,163,209,253],"\u201calmost":[80],"Unique\u201d":[81],"version":[82,106],"Label":[84,108,114,125],"Cover":[85,109,115,126],"can":[86],"be":[87],"approximated":[88],"within":[89],"constant":[91,141],"factor":[92],"on":[93,127],"instances.":[95],"Our":[96],"main":[97],"conceptual":[98],"contribution":[99],"formulation":[102],"(hypergraph)":[105],"we":[111,131],"call":[112],"V":[113,124],".":[116],"Assuming":[117],"conjecture":[119],"concerning":[120],"inapproximability":[122],"instances,":[130],"following":[134],"implications:":[135],"\u2022":[136,178,221],"There":[137],"absolute":[140],"c":[142,168],"0":[143,169],"such":[144],"k":[147,156,170,173,181,184,217,219,224,227,244],"\u2265":[148,185,228],"3,":[149,229],"given":[150],"instance":[153],"Boolean":[155],"-CSP,":[157],"it":[158,192,198,235,241],"hard":[160,194,237],"find":[162],"assignment":[164],"satisfying":[165],"more":[166],"than":[167],"2":[171],"/2":[172],"fraction":[174,211,255],"constraints.":[177],"Given":[179,222],"-uniform":[182,225],"hypergraph,":[183,226],"2,":[186],"\u03b5":[189,210,232,254],">":[190,233],"0,":[191,234],"tell":[196,239],"if":[197,240],"q":[200,215],"-strongly":[201],"colorable":[202,246],"or":[203,247],"no":[205,249],"independent":[206,250],"set":[207,251],"with":[208,252],"vertices,":[213],"where":[214],"=\u2308":[216],"+\u221a":[218],"-1/2\u2309.":[220],"(":[243],"-1)-rainbow":[245],"vertices.":[257]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}