{"id":"https://openalex.org/W2066467737","doi":"https://doi.org/10.1145/1993636.1993725","title":"Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP","display_name":"Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2066467737","doi":"https://doi.org/10.1145/1993636.1993725","mag":"2066467737"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993725","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993725","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993725","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993725","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]},{"id":"https://openalex.org/I4210166566","display_name":"Preferred Networks (Japan)","ror":"https://ror.org/05xeefy56","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210166566"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":["Kyoto University & Preferred Infrastructure, Kyoto, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kyoto University & Preferred Infrastructure, Kyoto, Japan","institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4210166566"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038701345"],"corresponding_institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4210166566"],"apc_list":null,"apc_paid":null,"fwci":2.5855,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.89951513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"665","last_page":"674"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.9983000159263611,"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/rounding","display_name":"Rounding","score":0.786658763885498},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7235004901885986},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6262561082839966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6094220280647278},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5850189328193665},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5698879361152649},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5445147156715393},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.519802451133728},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.47642549872398376},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4649188816547394},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46197521686553955},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4305069148540497},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4199599027633667},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35600247979164124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3146454095840454},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06443968415260315}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.786658763885498},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7235004901885986},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6262561082839966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6094220280647278},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5850189328193665},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5698879361152649},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5445147156715393},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.519802451133728},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.47642549872398376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4649188816547394},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46197521686553955},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4305069148540497},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4199599027633667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35600247979164124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3146454095840454},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06443968415260315},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/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/1993636.1993725","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993725","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993725","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/1993636.1993725","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993725","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993725","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2066467737.pdf","grobid_xml":"https://content.openalex.org/works/W2066467737.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1526220139","https://openalex.org/W1527654424","https://openalex.org/W1539682630","https://openalex.org/W1576805635","https://openalex.org/W1589412332","https://openalex.org/W1592213313","https://openalex.org/W1973652906","https://openalex.org/W1975810219","https://openalex.org/W1980155175","https://openalex.org/W1980816908","https://openalex.org/W1985123706","https://openalex.org/W1998137177","https://openalex.org/W1999032440","https://openalex.org/W2013493321","https://openalex.org/W2014086530","https://openalex.org/W2069816168","https://openalex.org/W2088844265","https://openalex.org/W2094135928","https://openalex.org/W2095933180","https://openalex.org/W2099677042","https://openalex.org/W2103649698","https://openalex.org/W2109330224","https://openalex.org/W2110871651","https://openalex.org/W2119378898","https://openalex.org/W2120358419","https://openalex.org/W2139374679","https://openalex.org/W2155188403","https://openalex.org/W2155479391","https://openalex.org/W2163672273","https://openalex.org/W2165947532","https://openalex.org/W2495669089","https://openalex.org/W2611773579","https://openalex.org/W2913941596","https://openalex.org/W2951784100"],"related_works":["https://openalex.org/W4220780102","https://openalex.org/W2410881844","https://openalex.org/W3196334750","https://openalex.org/W1502401885","https://openalex.org/W2004257129","https://openalex.org/W2116281088","https://openalex.org/W2357551824","https://openalex.org/W2016668641","https://openalex.org/W2047623182","https://openalex.org/W2543175834"],"abstract_inverted_index":{"Raghavendra":[0],"(STOC":[1,14],"2008)":[2],"gave":[3],"an":[4],"elegant":[5],"and":[6,37],"surprising":[7],"result:":[8],"if":[9],"Khot's":[10],"Unique":[11],"Games":[12],"Conjecture":[13],"2002)":[15],"is":[16,29],"true,":[17],"then":[18],"for":[19,41],"every":[20],"constraint":[21],"satisfaction":[22],"problem":[23],"(CSP),":[24],"the":[25],"best":[26],"approximation":[27],"ratio":[28],"attained":[30],"by":[31],"a":[32,38],"certain":[33],"simple":[34],"semidefinite":[35],"programming":[36],"rounding":[39],"scheme":[40],"it.":[42]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}