{"id":"https://openalex.org/W2014323766","doi":"https://doi.org/10.5555/1109557.1109569","title":"Approximating unique games","display_name":"Approximating unique games","alternate_titles":[],"publication_year":2006,"publication_date":"2006-01-22","ids":{"openalex":"https://openalex.org/W2014323766","doi":"https://doi.org/10.5555/1109557.1109569","mag":"2014323766"},"language":"en","primary_location":{"id":"pmh:oai:repository.cmu.edu:compsci-1835","doi":null,"is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1835&context=compsci","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W2014323766"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405","observed_orcids":["https://orcid.org/0000-0001-5579-3405"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5579-3405","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080065269","display_name":"Kunal Talwar","orcid":"https://orcid.org/0009-0000-5661-3541","observed_orcids":["https://orcid.org/0009-0000-5661-3541"]},"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":"Kunal Talwar","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":[],"apc_list":null,"apc_paid":null,"fwci":6.3406,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.97175187,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"99","last_page":"106"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9940999746322632,"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.9940999746322632,"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.0019000000320374966,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/unique-games","display_name":"unique games","score":0.8370000123977661},{"id":"https://openalex.org/keywords/unique-games-conjecture","display_name":"Unique Games Conjecture","score":0.8870000243186951},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9399999976158142},{"id":"https://openalex.org/keywords/lp-rounding","display_name":"LP rounding","score":0.6919999718666077},{"id":"https://openalex.org/keywords/semidefinite-relaxation","display_name":"semidefinite relaxation","score":0.8059999942779541},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.722000002861023},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.46700000762939453},{"id":"https://openalex.org/keywords/graph-labeling","display_name":"graph labeling","score":0.46000000834465027},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.6880000233650208},{"id":"https://openalex.org/keywords/vertex-cover-problem","display_name":"vertex cover","score":0.6039999723434448}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8255058526992798},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6556252241134644},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6432051658630371},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.642070472240448},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6088173389434814},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5625555515289307},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4694506525993347},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46155545115470886},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.45936957001686096},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4198479652404785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18750420212745667},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07022634148597717},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:repository.cmu.edu:compsci-1835","doi":null,"is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1835&context=compsci","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},{"id":"mag:2014323766","doi":"https://doi.org/10.5555/1109557.1109569","is_oa":false,"landing_page_url":"https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/19-p99-gupta.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.7513","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.7513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~anupamg/papers/soda06-unique.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.155.5439","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.5439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/pubs/65598/19-p99-gupta.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.644.6876","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.644.6876","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W83351988","https://openalex.org/W1502009568","https://openalex.org/W1571037334","https://openalex.org/W1985123706","https://openalex.org/W2068871408","https://openalex.org/W2082353536","https://openalex.org/W2095727035","https://openalex.org/W2099677042","https://openalex.org/W2100440346","https://openalex.org/W2120358419","https://openalex.org/W2125703559","https://openalex.org/W2127114399","https://openalex.org/W2137118456","https://openalex.org/W2611804663"],"related_works":["https://openalex.org/W3037076685","https://openalex.org/W2165732281","https://openalex.org/W2070208264","https://openalex.org/W2963988057","https://openalex.org/W7098440898","https://openalex.org/W7098770916","https://openalex.org/W186443161","https://openalex.org/W2272853635","https://openalex.org/W1481458511","https://openalex.org/W7098545410"],"abstract_inverted_index":{"The":[0,33,67],"Unique":[1,68,94,159],"Games":[2,69],"problem":[3,149,185],"is":[4,35,61,82,88],"the":[5,52,136,148,152,172,184,214],"following:":[6],"we":[7,26,141,200],"are":[8],"given":[9],"a":[10,24,28,38,45,83,205,219],"graph":[11],"G":[12],"=":[13,20,65,177,226],"(V,":[14],"E),":[15],"with":[16,44,96,102,189,221],"each":[17,41,78],"edge":[18,58],"e":[19],"(u,":[21,59],"v)":[22,60],"having":[23],"weight":[25,53],"and":[27,124,166],"permutation":[29],"\u03c0uv":[30],"on":[31,115],"[k].":[32],"objective":[34],"to":[36,50,90,132,203,208,213,217],"find":[37,218],"labeling":[39,220],"of":[40,54,71,93,150,154,163,183],"vertex":[42],"u":[43],"label":[46],"fu":[47],"\u2208":[48],"[k]":[49],"minimize":[51],"unsatisfied":[55,155,179,195,230],"edges\u2014where":[56],"an":[57,129,143,210],"satisfied":[62],"if":[63,171],"fv":[64],"\u03c0uv(fu).":[66],"Conjecture":[70],"Khot":[72,164],"[8]":[73,165],"essentially":[74],"says":[75],"that":[76,86,170],"for":[77,121,147],"\u03b5>":[79],"0,":[80],"there":[81],"k":[84],"such":[85],"it":[87,128],"NP-hard":[89],"distinguish":[91],"instances":[92],"games":[95],"(1\u2212\u03b5)":[97],"satisfiable":[98,105],"edges":[99,156],"from":[100],"those":[101],"only":[103,222],"\u03b5":[104],"edges.":[106,196,231],"Several":[107],"hardness":[108],"results":[109,162],"have":[110],"recently":[111],"been":[112],"proved":[113],"based":[114],"this":[116,139,198],"assumption,":[117],"including":[118],"optimal":[119,173],"ones":[120],"Max-Cut,":[122],"Vertex-Cover":[123],"other":[125],"problems,":[126],"making":[127],"important":[130],"challenge":[131],"prove":[133],"or":[134],"refute":[135],"conjecture.":[137],"In":[138,197],"paper,":[140],"give":[142,187],"O(log":[144,211],"n)-approximation":[145,212],"algorithm":[146],"minimizing":[151],"number":[153],"in":[157],"any":[158],"game.":[160],"Previous":[161],"Trevisan":[167],"[12]":[168],"imply":[169],"solution":[174],"has":[175],"OPT":[176],"\u03b5m":[178],"edges,":[180],"semidefinite":[181],"relaxations":[182],"could":[186],"labelings":[188],"min{k2\u03b51/5,":[190],"(\u03b5":[191],"log":[192,224,228],"n)":[193,225,229],"1/2}m":[194],"paper":[199],"show":[201],"how":[202],"round":[204],"LP":[206],"relaxation":[207],"get":[209],"problem;":[215],"i.e.,":[216],"O(\u03b5m":[223],"O(OPT":[227],"1":[232]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2014323766","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
