{"id":"https://openalex.org/W2162018802","doi":"https://doi.org/10.1109/sfcs.1994.365710","title":"Approximate graph coloring by semidefinite programming","display_name":"Approximate graph coloring by semidefinite programming","publication_year":2002,"publication_date":"2002-12-17","ids":{"openalex":"https://openalex.org/W2162018802","doi":"https://doi.org/10.1109/sfcs.1994.365710","mag":"2162018802"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1994.365710","doi":"https://doi.org/10.1109/sfcs.1994.365710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1994.365710","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 35th Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5028448267","display_name":"David Ron Karger","orcid":"https://orcid.org/0000-0002-0024-5847","observed_orcids":["https://orcid.org/0000-0002-0024-5847"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. Karger","raw_affiliation_strings":["Stanford Univ., CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford Univ., CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112649653","display_name":"Rajeev Motwani","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Motwani","raw_affiliation_strings":["Department of Computer Science, University of Stanford, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Stanford, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489","observed_orcids":["https://orcid.org/0000-0003-3718-6489","https://orcid.org/0009-0005-6560-9663","https://orcid.org/0000-0001-7713-7003"]},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Sudan","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.9589,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.96502824,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2","last_page":"13"},"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.9101999998092651,"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.9101999998092651,"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.05050000175833702,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.017000000923871994,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/graph-coloring","display_name":"graph coloring","score":0.984000027179718},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"semidefinite programming","score":0.8429999947547913},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8240000009536743},{"id":"https://openalex.org/keywords/maximum-degree","display_name":"maximum degree","score":0.9169999957084656},{"id":"https://openalex.org/keywords/lovasz-theta-function","display_name":"Lov\u00e1sz theta function","score":0.8949999809265137},{"id":"https://openalex.org/keywords/randomized-polynomial-time-algorithms","display_name":"randomized polynomial-time algorithms","score":0.6399999856948853},{"id":"https://openalex.org/keywords/chromatic-number","display_name":"chromatic number","score":0.8579999804496765},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.6970000267028809},{"id":"https://openalex.org/keywords/max-2-sat","display_name":"MAX-2-SAT","score":0.9940000176429749}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8280091285705566},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7690251469612122},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5879352688789368},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5659962892532349},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5252342224121094},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5109354853630066},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5096676349639893},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.497440367937088},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4826520085334778},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.46063220500946045},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4469788670539856},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4452197551727295},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41154545545578003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2074471414089203},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11972656846046448},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11633306741714478},{"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},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.1994.365710","doi":"https://doi.org/10.1109/sfcs.1994.365710","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1994.365710","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 35th Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3774957022","display_name":"Randomness and Algorithms","funder_award_id":"9010517","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8081833360","display_name":"NYI:  The Complexity of Probablistic Algorithms","funder_award_id":"9357849","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307065","display_name":"Schlumberger Foundation","ror":"https://ror.org/03daw3m97"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W87828068","https://openalex.org/W773723236","https://openalex.org/W1530753374","https://openalex.org/W1546627792","https://openalex.org/W1548134571","https://openalex.org/W1963753244","https://openalex.org/W1972392483","https://openalex.org/W1982506822","https://openalex.org/W1991006936","https://openalex.org/W2003804316","https://openalex.org/W2005412366","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2036660814","https://openalex.org/W2047472567","https://openalex.org/W2059453880","https://openalex.org/W2078289947","https://openalex.org/W2079473728","https://openalex.org/W2080905757","https://openalex.org/W2089247135","https://openalex.org/W2100440346","https://openalex.org/W2104254886","https://openalex.org/W2118866757","https://openalex.org/W2127113976","https://openalex.org/W2127819793","https://openalex.org/W2128553546","https://openalex.org/W2130857672","https://openalex.org/W2137300667","https://openalex.org/W2141815340","https://openalex.org/W2143391442","https://openalex.org/W2153663865","https://openalex.org/W2295428206","https://openalex.org/W2751862591","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W2753908209","https://openalex.org/W2798909945","https://openalex.org/W2917997019","https://openalex.org/W3142780541","https://openalex.org/W3148529197","https://openalex.org/W3152126650","https://openalex.org/W4239534271","https://openalex.org/W4250047106","https://openalex.org/W6675809563"],"related_works":["https://openalex.org/W2125240990","https://openalex.org/W2602127376","https://openalex.org/W7099277303","https://openalex.org/W2010791033","https://openalex.org/W3037964612","https://openalex.org/W2043473394","https://openalex.org/W643253952","https://openalex.org/W4247919263","https://openalex.org/W7097979001","https://openalex.org/W1489655616"],"abstract_inverted_index":{"We":[0,13,162],"consider":[1],"the":[2,9,44,52,63,72,104,128,147,150,158,167,170,178,191],"problem":[3],"of":[4,47,59,71,107,138,149,173],"coloring":[5,88],"k-colorable":[6,83],"graphs":[7,84],"with":[8,28],"fewest":[10],"possible":[11],"colors.":[12,98],"give":[14],"a":[15,22,69,87,142],"randomized":[16],"polynomial":[17],"time":[18],"algorithm":[19,114],"which":[20,119],"colors":[21,39],"3-colorable":[23],"graph":[24],"on":[25,166],"n":[26],"vertices":[27],"min":[29,90],"{O(/spl":[30],"Delta//sup":[31,93],"1/3/log/sup":[32],"4/3//spl":[33],"Delta/),":[34],"O(n/sup":[35],"1/4/":[36],"log":[37],"n)}":[38],"where":[40],"/spl":[41,75,160,192],"Delta/":[42],"is":[43,141],"maximum":[45,73],"degree":[46,74],"any":[48],"vertex.":[49],"Besides":[50],"giving":[51],"best":[53],"known":[54],"approximation":[55,66],"ratio":[56],"in":[57],"terms":[58],"n,":[60],"this":[61,184],"marks":[62],"first":[64],"non-trivial":[65],"result":[67,78],"as":[68],"function":[70],"Delta/.":[76],"This":[77],"can":[79],"be":[80],"generalized":[81],"to":[82,85,123,153],"obtain":[86,124],"using":[89],"{O/spl":[91],"tilde/(/spl":[92],"1-2/k/),":[94],"O/spl":[95],"tilde/(n/sup":[96],"1-3/(k+1/))}":[97],"Our":[99],"results":[100],"are":[101],"inspired":[102],"by":[103,182],"recent":[105],"work":[106,140],"Goemans":[108],"and":[109,131,157,177],"Williamson":[110],"who":[111],"used":[112],"an":[113],"for":[115,127],"semidefinite":[116,155,175],"optimization":[117],"problems,":[118],"generalize":[120],"linear":[121],"programs,":[122],"improved":[125],"approximations":[126],"MAX":[129,132],"CUT":[130],"2-SAT":[133],"problems.":[134],"An":[135],"intriguing":[136],"outcome":[137],"our":[139,154,174],"duality":[143,183],"relationship":[144],"established":[145],"between":[146,169],"value":[148],"optimum":[151,171],"solution":[152,172],"program":[156,176],"Lovasz":[159],"thetav/-function.":[161],"show":[163],"lower":[164],"bounds":[165],"gap":[168],"actual":[179],"chromatic":[180],"number;":[181],"also":[185],"demonstrates":[186],"interesting":[187],"new":[188],"facts":[189],"about":[190],"thetav/-function.>":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}