{"id":"https://openalex.org/W2097098285","doi":"https://doi.org/10.4086/toc.2014.v010a013","title":"","display_name":"","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2097098285","doi":"https://doi.org/10.4086/toc.2014.v010a013","mag":"2097098285"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2014.v010a013","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2014.v010a013","pdf_url":"http://www.theoryofcomputing.org/articles/v010a013/v010a013.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v010a013/v010a013.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033681881","display_name":"Konstantin Makarychev","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Konstantin Makarychev","raw_affiliation_strings":["Microsoft research#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft research#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068045392","display_name":"Yury Makarychev","orcid":"https://orcid.org/0000-0003-3114-3947"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yury Makarychev","raw_affiliation_strings":["TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO"],"affiliations":[{"raw_affiliation_string":"TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033681881"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":2.1935,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.88149764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"10","issue":"1","first_page":"341","last_page":"358"},"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.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/arity","display_name":"Arity","score":0.8100135326385498},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.7899202108383179},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7115638256072998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7000706195831299},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6959375143051147},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5178340077400208},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4524562954902649},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4419293701648712},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4303549528121948},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08151355385780334}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.8100135326385498},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.7899202108383179},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7115638256072998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7000706195831299},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6959375143051147},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5178340077400208},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4524562954902649},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4419293701648712},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4303549528121948},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08151355385780334},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2014.v010a013","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2014.v010a013","pdf_url":"http://www.theoryofcomputing.org/articles/v010a013/v010a013.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2014.v010a013","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2014.v010a013","pdf_url":"http://www.theoryofcomputing.org/articles/v010a013/v010a013.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Quality Education","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G1006643207","display_name":null,"funder_award_id":"IIS-1302662","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5466695537","display_name":"RI: AF: Medium: Learning and Matrix Reconstruction with the Max-Norm and Related Factorization Norms","funder_award_id":"1302662","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7317792109","display_name":null,"funder_award_id":"CCF-1150062","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G807804884","display_name":"CAREER: Metric Geometry Techniques for Approximation Algorithms","funder_award_id":"1150062","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/W2097098285.pdf","grobid_xml":"https://content.openalex.org/works/W2097098285.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W105587991","https://openalex.org/W1975810219","https://openalex.org/W1992866589","https://openalex.org/W2037586880","https://openalex.org/W2070208264","https://openalex.org/W2091921997","https://openalex.org/W2097823813","https://openalex.org/W2106478922","https://openalex.org/W2110871651","https://openalex.org/W2120358419","https://openalex.org/W2125534993","https://openalex.org/W2165732281","https://openalex.org/W2165967486","https://openalex.org/W2179897858","https://openalex.org/W2621263703","https://openalex.org/W4226347946","https://openalex.org/W4230727657","https://openalex.org/W4244547255"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W1530739071","https://openalex.org/W2098281589","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W1443174385","https://openalex.org/W2732982824","https://openalex.org/W3123730328"],"abstract_inverted_index":{"In":[0,14],"this":[1],"paper":[2],"we":[3,17],"present":[4],"a":[5,20],"randomized":[6],"polynomial-time":[7],"approximation":[8],"algorithm":[9],"for":[10],"MAX-k-CSP":[11,15],"d":[12,16],".":[13],"are":[18],"given":[19],"set":[21],"of":[22,24,30,44],"predicates":[23],"arity":[25],"k":[26],"over":[27],"an":[28,38],"alphabet":[29],"size":[31],"d.":[32],"Our":[33],"goal":[34],"is":[35],"to":[36],"find":[37],"assignment":[39],"that":[40],"maximizes":[41],"the":[42],"number":[43],"satisfied":[45],"constraints.":[46]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2016-06-24T00:00:00"}