{"id":"https://openalex.org/W2010791033","doi":"https://doi.org/10.1145/237814.237980","title":"Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING","display_name":"Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2010791033","doi":"https://doi.org/10.1145/237814.237980","mag":"2010791033"},"language":"en","primary_location":{"id":"doi:10.1145/237814.237980","doi":"https://doi.org/10.1145/237814.237980","is_oa":true,"landing_page_url":"https://doi.org/10.1145/237814.237980","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/237814.237980","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/237814.237980","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip Klein","raw_affiliation_strings":["Department of Computer Science, Brown University","Dept. of Computer Science, Brown University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Dept. of Computer Science, Brown University","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102749438","display_name":"Hsueh-I Lu","orcid":"https://orcid.org/0000-0002-5755-2338","observed_orcids":["https://orcid.org/0000-0002-5755-2338"]},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsueh-I Lu","raw_affiliation_strings":["Department of Computer Science, Brown University","Dept. of Computer Science, Brown University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Dept. of Computer Science, Brown University","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":0.799,"has_fulltext":true,"cited_by_count":47,"citation_normalized_percentile":{"value":0.63270604,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"338","last_page":"347"},"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.9398999810218811,"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.9398999810218811,"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.05620000138878822,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0006000000284984708,"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.9340000152587891},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.7620000243186951},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"graph coloring","score":0.9980000257492065},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9789999723434448},{"id":"https://openalex.org/keywords/goemans-williamson-algorithm","display_name":"Goemans-Williamson algorithm","score":0.8889999985694885},{"id":"https://openalex.org/keywords/polynomial-time-approximation","display_name":"polynomial-time approximation","score":0.5099999904632568},{"id":"https://openalex.org/keywords/linear-time-approximation","display_name":"linear-time approximation","score":0.40400001406669617},{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"ellipsoid method","score":0.8050000071525574},{"id":"https://openalex.org/keywords/interior-point-methods","display_name":"interior point methods","score":0.7570000290870667}],"concepts":[{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.8114031553268433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6188256144523621},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5856404304504395},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45328691601753235},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.21924185752868652}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/237814.237980","doi":"https://doi.org/10.1145/237814.237980","is_oa":true,"landing_page_url":"https://doi.org/10.1145/237814.237980","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/237814.237980","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.6475","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.6475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/research/pubs/pdfs/1996/Klein-1996-EAA.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.7546","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.7546","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://wilma.cs.brown.edu/pub/techreports/96/cs96-07.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.2693","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.2693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/people/pnk/sdp.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.704.7433","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.704.7433","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csie.ntu.edu.tw/%7Ehil/paper/stoc96.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/237814.237980","doi":"https://doi.org/10.1145/237814.237980","is_oa":true,"landing_page_url":"https://doi.org/10.1145/237814.237980","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/237814.237980","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2010791033.pdf","grobid_xml":"https://content.openalex.org/works/W2010791033.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W391578156","https://openalex.org/W1484458065","https://openalex.org/W1484752611","https://openalex.org/W1963753244","https://openalex.org/W2010223239","https://openalex.org/W2034235667","https://openalex.org/W2035144082","https://openalex.org/W2035652501","https://openalex.org/W2065534115","https://openalex.org/W2069816168","https://openalex.org/W2075379600","https://openalex.org/W2078289947","https://openalex.org/W2080905757","https://openalex.org/W2086917808","https://openalex.org/W2100440346","https://openalex.org/W2104103056","https://openalex.org/W2121902703","https://openalex.org/W2128202699","https://openalex.org/W2128978199","https://openalex.org/W2134422938","https://openalex.org/W2162018802","https://openalex.org/W2164911818","https://openalex.org/W2168204766","https://openalex.org/W2566335580","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W2917997019","https://openalex.org/W4237318394","https://openalex.org/W4239666166","https://openalex.org/W4242767541"],"related_works":["https://openalex.org/W956804560","https://openalex.org/W1489434708","https://openalex.org/W1520493688","https://openalex.org/W1489655616","https://openalex.org/W1985123706","https://openalex.org/W1756950477","https://openalex.org/W2162018802","https://openalex.org/W2080905757","https://openalex.org/W7099069108","https://openalex.org/W3127344537"],"abstract_inverted_index":{"The":[0],"best":[1],"known":[2,56],"approximation":[3,40],"algorithm":[4,41],"for":[5,42,76],"graph":[6,26,43],"MAX":[7],"CUT,":[8],"due":[9],"to":[10],"Goemans":[11],"and":[12,22,36,81],"Williamson,":[13],"first":[14],"finds":[15],"the":[16],"optimal":[17],"solution":[18],"a":[19,25,49],"semidefinite":[20,50,53],"program":[21],"then":[23],"derives":[24],"cut":[27],"from":[28],"that":[29,45],"solution.Building":[30],"on":[31],"this":[32],"result,":[33],"Karger,":[34],"Motwani,":[35],"Sudan":[37],"gave":[38],"an":[39],"coloring":[44],"also":[46],"involves":[47],"solving":[48],"program.Solving":[51],"these":[52],"programs":[54],"using":[55],"methods":[57],"(ellipsoid,":[58],"interiorpoint":[59],"),":[60],"though":[61],"polynomial-time,":[62],"is":[63],"quite":[64],"expensive.We":[65],"show":[66],"how":[67],"they":[68],"can":[69],"be":[70],"approximately":[71],"solved":[72],"in":[73],"~(nm)":[74],"time":[75],"graphs":[77],"with":[78],"n":[79],"nodes":[80],"m":[82],"edges.":[83]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}