{"id":"https://openalex.org/W2161737792","doi":"https://doi.org/10.1145/1060590.1060700","title":"Every 2-CSP allows nontrivial approximation","display_name":"Every 2-CSP allows nontrivial approximation","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W2161737792","doi":"https://doi.org/10.1145/1060590.1060700","mag":"2161737792"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060700","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5013166918","display_name":"Johan H\u00e5stad","orcid":"https://orcid.org/0000-0002-5379-345X"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Johan H\u00e5stad","raw_affiliation_strings":["Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013166918"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":3.1617,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.92546584,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"740","last_page":"746"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9993000030517578,"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.9976999759674072,"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.7536907196044922},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7473322153091431},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6684443354606628},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5833475589752197},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5456238389015198},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5437686443328857},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5237095952033997},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5069611072540283},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.504935085773468},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5030643343925476},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4953285753726959},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4384949505329132},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42197418212890625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.403673380613327},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39415496587753296},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05546313524246216}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7536907196044922},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7473322153091431},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6684443354606628},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5833475589752197},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5456238389015198},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5437686443328857},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5237095952033997},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5069611072540283},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.504935085773468},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5030643343925476},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4953285753726959},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4384949505329132},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42197418212890625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.403673380613327},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39415496587753296},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05546313524246216},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1060590.1060700","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1502009568","https://openalex.org/W1529433769","https://openalex.org/W1530739071","https://openalex.org/W1571873445","https://openalex.org/W1963753244","https://openalex.org/W1967935161","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2026820987","https://openalex.org/W2027020884","https://openalex.org/W2035016254","https://openalex.org/W2036265926","https://openalex.org/W2043963325","https://openalex.org/W2058422149","https://openalex.org/W2067352618","https://openalex.org/W2068190866","https://openalex.org/W2081254453","https://openalex.org/W2087038607","https://openalex.org/W2091921997","https://openalex.org/W2097646889","https://openalex.org/W2099677042","https://openalex.org/W2117290960","https://openalex.org/W2120358419","https://openalex.org/W2132991500","https://openalex.org/W2133344054","https://openalex.org/W2143112402","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2166566648","https://openalex.org/W2167681887","https://openalex.org/W2476096155"],"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":{"We":[0],"use":[1],"semidefinite":[2],"programming":[3],"to":[4],"prove":[5],"that":[6,22,36,45],"any":[7,15],"constraint":[8,47],"satisfaction":[9],"problem":[10],"in":[11,42,65],"two":[12],"variables":[13],"over":[14],"domain":[16],"allows":[17],"an":[18,70],"efficient":[19],"approximation":[20],"algorithm":[21],"does":[23],"provably":[24],"better":[25],"than":[26],"picking":[27],"a":[28,79],"random":[29],"assignment.":[30],"To":[31],"be":[32],"more":[33],"precise":[34],"assume":[35],"each":[37,46],"variable":[38],"can":[39],"take":[40],"values":[41],"[d]":[43],"and":[44],"rejects":[48],"t":[49],"out":[50],"of":[51,86],"the":[52],"d2":[53],"possible":[54],"input":[55],"pairs.":[56],"Then,":[57],"for":[58],"some":[59],"universal":[60],"constant":[61],"c,":[62],"we":[63],"can,":[64],"probabilistic":[66],"polynomial":[67],"time,":[68],"find":[69],"assignment":[71],"whose":[72],"objective":[73],"value":[74],"is,":[75],"on":[76],"expectation,":[77],"within":[78],"factor":[80],"(1-":[81],"t/d2(1-":[82],"c/d2":[83],"log":[84],"d))":[85],"optimal.":[87]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}