{"id":"https://openalex.org/W4281977994","doi":"https://doi.org/10.1145/3519935.3520072","title":"A characterization of approximability for biased CSPs","display_name":"A characterization of approximability for biased CSPs","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281977994","doi":"https://doi.org/10.1145/3519935.3520072"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520072","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["University of Michigan, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082860877","display_name":"Suprovat Ghoshal","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Suprovat Ghoshal","raw_affiliation_strings":["University of Michigan, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075423314"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.5843,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68871199,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"989","last_page":"997"},"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.9994999766349792,"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.9994999766349792,"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.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.996999979019165,"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7929378151893616},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5314192771911621},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5208778381347656},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4760969877243042},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.46050259470939636},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45733386278152466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4183712899684906},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3961619436740875},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3307730257511139},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13158363103866577},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12282165884971619}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7929378151893616},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5314192771911621},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5208778381347656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4760969877243042},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.46050259470939636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45733386278152466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4183712899684906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3961619436740875},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3307730257511139},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13158363103866577},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12282165884971619},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3520072","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1601503375","https://openalex.org/W1886138972","https://openalex.org/W1965562201","https://openalex.org/W1973898585","https://openalex.org/W2011402196","https://openalex.org/W2019404063","https://openalex.org/W2030365814","https://openalex.org/W2036836182","https://openalex.org/W2047569272","https://openalex.org/W2069816168","https://openalex.org/W2072802070","https://openalex.org/W2079751294","https://openalex.org/W2080905757","https://openalex.org/W2081684569","https://openalex.org/W2082618810","https://openalex.org/W2087038607","https://openalex.org/W2091602684","https://openalex.org/W2098350988","https://openalex.org/W2108967854","https://openalex.org/W2110871651","https://openalex.org/W2120358419","https://openalex.org/W2127816126","https://openalex.org/W2405977959","https://openalex.org/W2514739098","https://openalex.org/W2552383377","https://openalex.org/W2613308084","https://openalex.org/W2949580236","https://openalex.org/W2951914620","https://openalex.org/W2953269844","https://openalex.org/W2963519787","https://openalex.org/W2977701101","https://openalex.org/W3002262398","https://openalex.org/W3044099633","https://openalex.org/W3135063256","https://openalex.org/W3217670380"],"related_works":["https://openalex.org/W2161128834","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2097415053","https://openalex.org/W2012141606","https://openalex.org/W1550482496","https://openalex.org/W2784687883","https://openalex.org/W2102858635","https://openalex.org/W2012694101","https://openalex.org/W2470231588"],"abstract_inverted_index":{"A":[0],"\u00b5-biased":[1],"Max-CSP":[2],"instance":[3,11],"with":[4],"predicate":[5],"\u03c8:{0,1}r":[6],"\u2192":[7],"{0,1}":[8],"is":[9,20],"an":[10],"of":[12,25,36],"Constraint":[13],"Satisfaction":[14],"Problem":[15],"(CSP)":[16],"where":[17],"the":[18,33],"objective":[19],"to":[21],"find":[22],"a":[23],"labeling":[24],"relative":[26],"weight":[27],"at":[28],"most":[29],"\u00b5":[30],"which":[31],"satisfies":[32],"maximum":[34],"fraction":[35],"constraints.":[37],"Biased":[38],"CSPs":[39],"are":[40],"versatile":[41],"and":[42,51],"express":[43],"several":[44],"well":[45],"studied":[46],"problems":[47],"such":[48],"as":[49],"Densest-k-Sub(Hyper)graph":[50],"SmallSetExpansion.":[52]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}