{"id":"https://openalex.org/W2023546589","doi":"https://doi.org/10.1137/080721479","title":"Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lov\u00e1sz\u2013Schrijver Hierarchy","display_name":"Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lov\u00e1sz\u2013Schrijver Hierarchy","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2023546589","doi":"https://doi.org/10.1137/080721479","mag":"2023546589"},"language":"nl","primary_location":{"id":"doi:10.1137/080721479","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080721479","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/A5020851132","display_name":"Konstantinos Georgiou","orcid":"https://orcid.org/0000-0002-9851-1196"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Konstantinos Georgiou","raw_affiliation_strings":["cgeorg@cs.toronto.edu and avner@cs.toronto.edu and toni@cs.toronto.edu and iannis@cs.toronto.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"cgeorg@cs.toronto.edu and avner@cs.toronto.edu and toni@cs.toronto.edu and iannis@cs.toronto.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043150610","display_name":"Avner Magen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avner Magen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003318200","display_name":"Toniann Pitassi","orcid":"https://orcid.org/0000-0002-8668-2174"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toniann Pitassi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5074107236","display_name":"Iannis Tourlakis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iannis Tourlakis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5020851132"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.758,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.93011567,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"39","issue":"8","first_page":"3553","last_page":"3570"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9902999997138977,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.8819320201873779},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7839447259902954},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7027701139450073},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6225182414054871},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5985051393508911},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5934450030326843},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5845428705215454},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5252102017402649},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4670473635196686},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4546034038066864},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38766294717788696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27120551466941833},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1856217384338379},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09812909364700317}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8819320201873779},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7839447259902954},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7027701139450073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6225182414054871},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5985051393508911},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5934450030326843},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5845428705215454},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5252102017402649},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4670473635196686},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4546034038066864},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38766294717788696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27120551466941833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1856217384338379},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09812909364700317},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/080721479","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080721479","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.586.4263","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.586.4263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~toni/Papers/vc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W153015188","https://openalex.org/W1587123489","https://openalex.org/W1971749164","https://openalex.org/W1985123706","https://openalex.org/W2010990954","https://openalex.org/W2030970869","https://openalex.org/W2078289947","https://openalex.org/W2086653003","https://openalex.org/W2088844265","https://openalex.org/W2106264302","https://openalex.org/W2106471982","https://openalex.org/W2137118456","https://openalex.org/W2143698439","https://openalex.org/W4236977434","https://openalex.org/W4239534271"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2023546589","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W159504299","https://openalex.org/W2096382750","https://openalex.org/W2094388041","https://openalex.org/W3102280101"],"abstract_inverted_index":{"Linear":[0],"and":[1,24,50,130,146,153,159,174,187],"semidefinite":[2,28],"programming":[3],"are":[4,95],"highly":[5],"suc-cessful":[6],"approaches":[7],"for":[8,12,21,101,139,155,184,200,214,240],"obtaining":[9],"good":[10],"approximations":[11],"NP-hard":[13,34],"optimization":[14],"problems.":[15],"For":[16],"example,":[17],"break-through":[18],"approximation":[19,38,138,262],"algorithms":[20,133,183],"MAX":[22,185],"CUT":[23,26,186,189],"SPARSEST":[25,188],"use":[27],"programming.":[29],"Perhaps":[30],"the":[31,67,76,82,96,150,180,221,244],"most":[32,97],"prominent":[33],"problem":[35],"whose":[36],"exact":[37],"factor":[39,62,77,105],"is":[40,43,56,88,121],"still":[41],"unresolved":[42],"VER-TEX":[44],"COVER.":[45],"PCP-based":[46],"techniques":[47,94],"of":[48,78,106,111,128,172,212,232,267],"Dinur":[49],"Safra":[51],"[7]":[52],"show":[53,123],"that":[54,92,124],"it":[55],"not":[57,252],"possible":[58],"to":[59,122,135],"achieve":[60],"a":[61,89,109,125,260],"better":[63,74,142],"than":[64,75,143],"1.36;":[65],"on":[66],"other":[68],"hand":[69],"no":[70],"known":[71,239],"algorithm":[72],"does":[73],"2":[79,196],"achieved":[80],"by":[81,114,219,258],"simple":[83],"greedy":[84],"algorithm.":[85],"Furthermore,":[86],"there":[87],"widespread":[90],"belief":[91],"SDP":[93,131,160,175],"promising":[98],"meth-ods":[99],"available":[100],"improving":[102],"upon":[103],"this":[104],"2.":[107,144],"Following":[108],"line":[110],"study":[112],"initiated":[113],"Arora":[115],"et":[116],"al.":[117],"[3],":[118],"our":[119],"aim":[120],"large":[126,170],"family":[127],"LP":[129,158,173,223],"based":[132],"fail":[134],"produce":[136],"an":[137,209],"VERTEX":[140,201,215,241],"COVER":[141,202,216,242],"Lova\u0301sz":[145],"Schri-jver":[147],"[21]":[148],"introduced":[149],"systems":[151,167],"LS":[152,246],"LS+":[154,178],"sys-tematically":[156],"tightening":[157,220],"relaxations,":[161],"respec-tively,":[162],"over":[163],"many":[164],"rounds.":[165],"These":[166],"naturally":[168],"cap-ture":[169],"classes":[171],"relaxations;":[176],"indeed,":[177],"captures":[179],"celebrated":[181],"SDP-based":[182],"mentioned":[190],"above.":[191],"We":[192],"rule":[193,253],"out":[194,254],"polynomial-time":[195],"\u2212":[197],"\u2126(1)":[198],"approxima-tions":[199],"using":[203],"LS+.":[204,233,268],"In":[205],"particular,":[206],"we":[207],"prove":[208],"integrality":[210,236],"gap":[211],"2\u2212o(1)":[213],"SDPs":[217],"obtained":[218],"standard":[222],"relaxation":[224],"with":[225],"\u2126(":[226],"logn":[227],"/":[228],"log":[229],"logn)":[230],"rounds":[231,266],"While":[234],"tight":[235],"gaps":[237],"were":[238],"in":[243,256],"weaker":[245],"system":[247],"[23],":[248],"previous":[249],"results":[250],"did":[251],"Funded":[255],"part":[257],"NSERC":[259],"2\u2212\u2126(1)":[261],"after":[263],"even":[264],"two":[265]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}