{"id":"https://openalex.org/W2059187303","doi":"https://doi.org/10.1145/1060590.1060634","title":"Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy","display_name":"Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W2059187303","doi":"https://doi.org/10.1145/1060590.1060634","mag":"2059187303"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060634","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060634","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":"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/A5108227774","display_name":"M. Alekhnovich","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108547","display_name":"EarthTech International (United States)","ror":"https://ror.org/01mjdf856","country_code":"US","type":"company","lineage":["https://openalex.org/I4210108547"]},{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mikhail Alekhnovich","raw_affiliation_strings":["Institute for Advanced Studies, Princeton, NJ","Institute for Advanced Studies, Princeton, NJ#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Studies, Princeton, NJ","institution_ids":["https://openalex.org/I40036882","https://openalex.org/I4210108547"]},{"raw_affiliation_string":"Institute for Advanced Studies, Princeton, NJ#TAB#","institution_ids":["https://openalex.org/I40036882","https://openalex.org/I4210108547"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103209777","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0003-4852-691X"},"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":"Sanjeev Arora","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074107236","display_name":"Iannis Tourlakis","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":"Iannis Tourlakis","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108227774"],"corresponding_institution_ids":["https://openalex.org/I40036882","https://openalex.org/I4210108547"],"apc_list":null,"apc_paid":null,"fwci":6.6757,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.97295263,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"294","last_page":"303"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.7900927066802979},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.542161226272583},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5095344185829163},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.1375434398651123}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.7900927066802979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.542161226272583},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5095344185829163},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.1375434398651123},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1060590.1060634","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060634","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W153015188","https://openalex.org/W1587123489","https://openalex.org/W1598148804","https://openalex.org/W1967821609","https://openalex.org/W1972894929","https://openalex.org/W1985123706","https://openalex.org/W1999032440","https://openalex.org/W2000869424","https://openalex.org/W2003159902","https://openalex.org/W2004012902","https://openalex.org/W2020632401","https://openalex.org/W2028146521","https://openalex.org/W2031364557","https://openalex.org/W2049143039","https://openalex.org/W2080905757","https://openalex.org/W2083896132","https://openalex.org/W2086653003","https://openalex.org/W2087226760","https://openalex.org/W2106264302","https://openalex.org/W2115404728","https://openalex.org/W2120358419","https://openalex.org/W2137373403","https://openalex.org/W2143698439","https://openalex.org/W2143996311","https://openalex.org/W2146823188","https://openalex.org/W2149108377","https://openalex.org/W2167508847","https://openalex.org/W2168669141","https://openalex.org/W2917997019"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2365264209","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2509431957","https://openalex.org/W2376932109","https://openalex.org/W2026999166","https://openalex.org/W2130966263","https://openalex.org/W2466345496"],"abstract_inverted_index":{"Lovasz":[0],"and":[1,11,36,55,113],"Schrijver":[2],"described":[3],"a":[4],"generic":[5],"method":[6],"of":[7,25,70],"tightening":[8],"the":[9,23,61,71,82,85],"LP":[10],"SDP":[12],"relaxation":[13],"for":[14,32,46,94],"any":[15],"0-1":[16],"optimization":[17],"problem.":[18],"These":[19],"tightened":[20],"relaxations":[21,62],"were":[22],"basis":[24],"several":[26,115],"celebrated":[27],"approximation":[28,92],"algorithms":[29,93],"(such":[30],"as":[31,50,65,67],"max-cu":[33],",":[34],"max-3sat,":[35,51],"sparsest":[37],"cut).We":[38],"prove":[39],"strong":[40],"inapproximability":[41,108],"results":[42,102,109],"in":[43],"this":[44],"model":[45],"well-known":[47],"problems":[48],"such":[49],"hypergraph":[52],"vertex":[53],"cover":[54],"set":[56],"cover.":[57],"We":[58],"show":[59],"that":[60,84],"produced":[63],"by":[64],"many":[66],"\u03a9(n)":[68],"rounds":[69],"LS+":[72,86],"procedure":[73],"do":[74],"not":[75],"allow":[76],"nontrivial":[77],"approximation,":[78],"thus":[79],"ruling":[80],"out":[81,99],"possibility":[83],"approach":[87],"gives":[88],"even":[89],"slightly":[90],"subexponential":[91],"these":[95],"problems.We":[96],"also":[97],"point":[98],"why":[100],"our":[101],"are":[103],"somewhat":[104],"incomparable":[105],"to":[106],"known":[107],"proved":[110],"using":[111],"PCPs,":[112],"formalize":[114],"interesting":[116],"open":[117],"questions.":[118]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
