{"id":"https://openalex.org/W2072300101","doi":"https://doi.org/10.1109/isit.2009.5205779","title":"An SDP primal-dual algorithm for approximating the Lov&amp;#x00E1;sz-theta function","display_name":"An SDP primal-dual algorithm for approximating the Lov&amp;#x00E1;sz-theta function","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2072300101","doi":"https://doi.org/10.1109/isit.2009.5205779","mag":"2072300101"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205779","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5018708584","display_name":"T-H. Hubert Chan","orcid":"https://orcid.org/0000-0002-8340-235X"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"T-H. Hubert Chan","raw_affiliation_strings":["Max-Planck-Institut fur Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut fur Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038076555","display_name":"Kevin Chang","orcid":"https://orcid.org/0000-0001-6895-8950"},"institutions":[{"id":"https://openalex.org/I4210134091","display_name":"Yahoo (United States)","ror":"https://ror.org/040dkzz12","country_code":"US","type":"company","lineage":["https://openalex.org/I4210134091"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin L. Chang","raw_affiliation_strings":["Yahoo Labs Santa Clara, California, USA","Yahoo Research Laboratories, Santa Clara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yahoo Labs Santa Clara, California, USA","institution_ids":["https://openalex.org/I4210134091"]},{"raw_affiliation_string":"Yahoo Research Laboratories, Santa Clara, CA, USA","institution_ids":["https://openalex.org/I4210134091"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108123578","display_name":"Rajiv Raman","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rajiv Raman","raw_affiliation_strings":["Max-Planck-Institut fur Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut fur Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0636,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.77575548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2808","last_page":"2812"},"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.9998000264167786,"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.9998000264167786,"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.9984999895095825,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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/combinatorics","display_name":"Combinatorics","score":0.5637128949165344},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5096626281738281},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5072934031486511},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36321312189102173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35887643694877625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32146376371383667}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5637128949165344},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5096626281738281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5072934031486511},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36321312189102173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35887643694877625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32146376371383667},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2009.5205779","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:hub.hku.hk:10722/92637","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/92637","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference_Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1516439426","https://openalex.org/W1548134571","https://openalex.org/W1963753244","https://openalex.org/W1967772216","https://openalex.org/W1973199140","https://openalex.org/W1974785036","https://openalex.org/W1981745143","https://openalex.org/W1991728994","https://openalex.org/W1995547833","https://openalex.org/W2010791033","https://openalex.org/W2014029180","https://openalex.org/W2069816168","https://openalex.org/W2075247318","https://openalex.org/W2078289947","https://openalex.org/W2082242399","https://openalex.org/W2091075671","https://openalex.org/W2100440346","https://openalex.org/W2104103056","https://openalex.org/W2113884532","https://openalex.org/W2122140789","https://openalex.org/W2134422938","https://openalex.org/W2143474538","https://openalex.org/W2150865801","https://openalex.org/W2164684058","https://openalex.org/W2165956524","https://openalex.org/W2183153039","https://openalex.org/W2583492247","https://openalex.org/W2798909945","https://openalex.org/W3016299094","https://openalex.org/W3150680109","https://openalex.org/W6686223982"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"The":[0],"Lovaacutesz":[1],"thetav-function":[2,81],"[Lov79]":[3],"on":[4],"a":[5,23,49,133,167],"graph":[6,55],"G":[7],"=":[8,38,116,123],"(V,E)":[9],"can":[10,163],"be":[11,164],"defined":[12],"as":[13,48,58],"the":[14,17,20,80,130,142,148,154],"maximum":[15,59,63,149,155],"of":[16,19,22,86,169],"sum":[18],"entries":[21],"positive":[24],"semidefinite":[25],"matrix":[26,134],"X,":[27],"whose":[28],"trace":[29],"Tr(X)":[30],"equals":[31],"1,":[32],"and":[33,62,68,118,146,153],"X":[34],"<sub":[35,110,120],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[36,96,100,104,111,121,126,175,179],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">ij</sub>":[37],"0":[39],"whenever":[40],"{i,":[41],"j}":[42],"isin":[43],"E.":[44],"This":[45],"function":[46],"appears":[47],"subroutine":[50],"for":[51,54,72,79,132,158],"many":[52],"algorithms":[53],"problems":[56],"such":[57],"independent":[60,150],"set":[61,151],"clique.":[64],"We":[65],"apply":[66],"Arora":[67],"Kale's":[69],"primal-dual":[70],"method":[71],"SDP":[73],"to":[74,141],"design":[75],"an":[76,83],"approximate":[77],"algorithm":[78],"with":[82],"additive":[84],"error":[85],"delta":[87],">":[88],"0,":[89],"which":[90],"runs":[91],"in":[92,171],"time":[93,131,172],"O(alpha":[94],"<sup":[95,99,103,125,174,178],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[97,101,105],"n":[98,107,177],"/delta":[102],"log":[106,181],"middot":[108],"M":[109,119],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">e</sub>":[112,122],"),":[113],"where":[114],"alpha":[115],"thetav(G)":[117],"O(n":[124],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3</sup>":[127],")":[128],"is":[129],"exponentiation":[135],"operation.":[136],"Moreover,":[137],"our":[138],"techniques":[139],"generalize":[140],"weighted":[143,160],"Lovasz":[144],"thetav-function,":[145],"both":[147],"weight":[152,157],"clique":[156],"vertex":[159],"perfect":[161],"graphs":[162],"approximated":[165],"within":[166],"factor":[168],"(1+epsi)":[170],"O(epsi":[173],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-2</sup>":[176],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">5</sup>":[180],"n).":[182]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}