{"id":"https://openalex.org/W1575386191","doi":"https://doi.org/10.1137/090756144","title":"Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant","display_name":"Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1575386191","doi":"https://doi.org/10.1137/090756144","mag":"1575386191"},"language":"en","primary_location":{"id":"doi:10.1137/090756144","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090756144","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["guruswami@cmu.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"guruswami@cmu.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013166918","display_name":"Johan H\u00e5stad","orcid":"https://orcid.org/0000-0002-5379-345X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Johan H\u00c5stad","raw_affiliation_strings":["johanh@kth.se#TAB#"],"affiliations":[{"raw_affiliation_string":"johanh@kth.se#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008657432","display_name":"Rajsekar Manokaran","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajsekar Manokaran","raw_affiliation_strings":["rajsekar@cs.princeton.edu and moses@cs.princeton.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"rajsekar@cs.princeton.edu and moses@cs.princeton.edu#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101701586","display_name":"Prasad Raghavendra","orcid":"https://orcid.org/0009-0009-7851-0653"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prasad Raghavendra","raw_affiliation_strings":["praghave@cc.gatech.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"praghave@cc.gatech.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071016611","display_name":"Moses Charikar","orcid":"https://orcid.org/0000-0003-0807-3389"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moses Charikar","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5068388812"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.04608666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"40","issue":"3","first_page":"878","last_page":"914"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9921000003814697,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9921000003814697,"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.9897000193595886,"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"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9704999923706055,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.9460684061050415},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8113934993743896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6891270875930786},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5753811001777649},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.562730610370636},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5235209465026855},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46621280908584595},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.42602938413619995},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4044948220252991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09618204832077026}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.9460684061050415},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8113934993743896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6891270875930786},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5753811001777649},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.562730610370636},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5235209465026855},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46621280908584595},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.42602938413619995},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4044948220252991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09618204832077026},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/090756144","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090756144","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.5939","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.5939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nada.kth.se/%7Ejohanh/ghmrc.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.727.9050","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.727.9050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.kth.se/%7Erajsekar/papers/ocsp.pdf","raw_type":"text"},{"id":"mag:1575386191","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/report/2011/027","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1975433230","https://openalex.org/W1980530521","https://openalex.org/W1985123706","https://openalex.org/W1990255213","https://openalex.org/W1999032440","https://openalex.org/W2010471713","https://openalex.org/W2027020884","https://openalex.org/W2038225707","https://openalex.org/W2040831377","https://openalex.org/W2070745908","https://openalex.org/W2078929687","https://openalex.org/W2083360043","https://openalex.org/W2087038607","https://openalex.org/W2097646889","https://openalex.org/W2137118456","https://openalex.org/W2162784288","https://openalex.org/W2179897858","https://openalex.org/W2789043785","https://openalex.org/W2953534551"],"related_works":["https://openalex.org/W2489413438","https://openalex.org/W2968629363","https://openalex.org/W1556442232","https://openalex.org/W2598828591","https://openalex.org/W3161226793","https://openalex.org/W226747779","https://openalex.org/W2129541994","https://openalex.org/W2760498448","https://openalex.org/W2904683578","https://openalex.org/W1553104975","https://openalex.org/W2951642689","https://openalex.org/W2953361700","https://openalex.org/W2949591167","https://openalex.org/W2950313774","https://openalex.org/W2592446496","https://openalex.org/W2569682947","https://openalex.org/W2398977735","https://openalex.org/W3178044378","https://openalex.org/W3127454746","https://openalex.org/W2549123310"],"abstract_inverted_index":{"We":[0,243],"prove":[1],"that,":[2,245],"assuming":[3],"the":[4,12,38,59,62,85,131,136,146,159,223,291,321,343],"Unique":[5],"Games":[6],"conjecture":[7],"(UGC),":[8],"every":[9,82,272],"problem":[10,152,323],"in":[11,141,229,265,311],"class":[13],"of":[14,41,99,103,116,145,148,172,182,188,199,202,208,219,225,234,290,316],"ordering":[15,144,161,218,233],"constraint":[16,22],"satisfaction":[17],"problems":[18],"(OCSPs)":[19],"where":[20,286,301],"each":[21,201],"has":[23,94,153,164],"constant":[24,76,83],"arity":[25,173],"is":[26,37,56,78,107,122,175,192,204,212,236,251,264,281,319,324],"approximation":[27,52],"resistant.":[28],"In":[29],"other":[30],"words,":[31],"we":[32,268],"show":[33,244,269],"that":[34,70,93,120,270,320,351],"if":[35],"$\\rho$":[36],"expected":[39,237],"fraction":[40,101,289,306],"constraints":[42,226,292],"satisfied":[43],"by":[44,133,177],"a":[45,50,72,89,100,166,178,193,197,215,240,255,287,304,329,340,352,363],"random":[46,160,232],"ordering,":[47],"then":[48],"obtaining":[49,71],"$\\rho'$":[51],"for":[53,74,81,162,246,257,259,271,356],"any":[54,75,247,260],"$\\rho'>\\rho$":[55],"UG-hard.":[57,79],"For":[58],"simplest":[60],"OCSP,":[61],"Maximum":[63],"Acyclic":[64],"Subgraph":[65],"(MAS)":[66],"problem,":[67],"this":[68],"implies":[69],"$\\rho$-approximation":[73],"$\\rho>1/2$":[77],"Specifically,":[80],"$\\varepsilon>0$":[84],"following":[86],"holds:":[87],"given":[88],"directed":[90],"graph":[91],"G":[92],"an":[95,126,142,190,205,276],"acyclic":[96,127],"subgraph":[97,128],"consisting":[98],"$(1-\\varepsilon)$":[102,288],"its":[104,117],"edges,":[105],"it":[106,121,250,280],"UG-hard":[108],"to":[109,124,213,238,253,283,297,326,336,342,361],"find":[110,125,214],"one":[111],"with":[112,129],"more":[113],"than":[114],"$(1/2+\\varepsilon)$":[115],"edges.":[118],"Note":[119],"trivial":[123],"$1/2$":[130],"edges":[132,140],"taking":[134],"either":[135],"forward":[137],"or":[138],"backward":[139],"arbitrary":[143],"vertices":[147],"G.":[149],"The":[150,210,262,332],"MAS":[151,163,357],"been":[154,165],"well":[155],"studied,":[156],"and":[157,196,275],"beating":[158],"basic":[167],"open":[168],"problem.":[169],"An":[170,186],"OCSP":[171,191],"k":[174],"specified":[176],"subset":[179],"$\\Pi\\subseteq":[180],"S_k$":[181],"permutations":[183],"on":[184],"$\\{1,2,\\dots,k\\}$.":[185],"instance":[187],"such":[189],"set":[194],"V":[195,220,235],"collection":[198],"constraints,":[200],"which":[203,338],"ordered":[206,227,295,309],"k-tuple":[207],"V.":[209],"objective":[211],"global":[216],"linear":[217],"while":[221],"maximizing":[222],"number":[224],"as":[228,310],"$\\Pi$.":[230,312],"A":[231,313],"satisfy":[239],"$\\rho=\\frac{|\\Pi|}{k!}$":[241],"fraction.":[242],"fixed":[248],"k,":[249],"hard":[252,282,325],"obtain":[254,362],"$\\rho'$-approximation":[256],"$\\Pi$-OCSP":[258],"$\\rho'>\\rho$.":[261],"result":[263,318],"fact":[266],"stronger:":[267],"$\\Lambda\\subseteq\\Pi\\subseteq":[273],"S_k$,":[274],"arbitrarily":[277],"small":[278],"$\\varepsilon$,":[279],"distinguish":[284],"instances":[285,300],"can":[293,307],"be":[294,308],"according":[296],"$\\Lambda$":[298],"from":[299],"at":[302],"most":[303],"$(\\rho+\\varepsilon)$":[305],"special":[314],"case":[315],"our":[317,347],"Betweenness":[322],"approximate":[327],"beyond":[328],"factor":[330],"$1/3$.":[331],"results":[333,348],"naturally":[334],"generalize":[335],"OCSPs":[337],"assign":[339],"payoff":[341],"different":[344],"permutations.":[345],"Finally,":[346],"imply":[349],"(unconditionally)":[350],"simple":[353],"semidefinite":[354],"relaxation":[355],"does":[358],"not":[359],"suffice":[360],"better":[364],"approximation.":[365]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}