{"id":"https://openalex.org/W2093546055","doi":"https://doi.org/10.1137/s0097539797321481","title":"How Good is the Goemans--Williamson MAX CUT Algorithm?","display_name":"How Good is the Goemans--Williamson MAX CUT Algorithm?","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2093546055","doi":"https://doi.org/10.1137/s0097539797321481","mag":"2093546055"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797321481","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797321481","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/A5087578885","display_name":"Howard Karloff","orcid":"https://orcid.org/0000-0003-4490-2324"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Howard Karloff","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087578885"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.1201,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.9660535,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"1","first_page":"336","last_page":"350"},"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.9997000098228455,"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.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9919999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7654940485954285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6474105715751648},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6442697048187256},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.524071216583252},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.503943145275116},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44362491369247437},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43394654989242554},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34651994705200195},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15761145949363708}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7654940485954285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6474105715751648},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6442697048187256},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.524071216583252},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.503943145275116},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44362491369247437},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43394654989242554},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34651994705200195},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15761145949363708},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539797321481","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797321481","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1985123706","https://openalex.org/W2012605254","https://openalex.org/W2041089572","https://openalex.org/W2069816168","https://openalex.org/W2158907148"],"related_works":["https://openalex.org/W2784134589","https://openalex.org/W2132400628","https://openalex.org/W579949368","https://openalex.org/W2952554274","https://openalex.org/W3178878483","https://openalex.org/W3000089047","https://openalex.org/W1985283864","https://openalex.org/W3110578096","https://openalex.org/W3017511404","https://openalex.org/W2366269287"],"abstract_inverted_index":{"The":[0],"celebrated":[1],"semidefinite":[2],"programming":[3],"algorithm":[4,53],"for":[5],"MAX":[6],"CUT":[7],"introduced":[8],"by":[9],"Goemans":[10],"and":[11],"Williamson":[12],"was":[13,43],"known":[14],"to":[15,64,69],"have":[16],"a":[17],"performance":[18,41,49,72],"ratio":[19,42,50],"of":[20,51],"at":[21],"least":[22],"$\\alpha=\\frac":[23],"2":[24],"{\\pi}":[25],"\\min_{0":[26],"<":[27,35,37],"\\theta\\le":[28],"\\pi}":[29],"\\frac":[30],"\\theta":[31],"{1-\\cos":[32],"\\theta}$":[33],"($0.87856":[34],"\\alpha":[36],"0.87857$);":[38],"the":[39,48,71],"exact":[40],"unknown.":[44],"We":[45],"prove":[46],"that":[47,60],"their":[52],"is":[54,62],"exactly":[55],"$\\alpha$.":[56],"Furthermore,":[57],"we":[58],"show":[59],"it":[61],"impossible":[63],"add":[65],"valid":[66],"linear":[67],"constraints":[68],"improve":[70],"ratio.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}