{"id":"https://openalex.org/W4384405943","doi":"https://doi.org/10.1145/3609426","title":"An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut","display_name":"An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut","publication_year":2023,"publication_date":"2023-07-15","ids":{"openalex":"https://openalex.org/W4384405943","doi":"https://doi.org/10.1145/3609426"},"language":"en","primary_location":{"id":"doi:10.1145/3609426","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3609426","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.19","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087614513","display_name":"Renee Mirka","orcid":"https://orcid.org/0000-0003-1470-639X"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Renee Mirka","raw_affiliation_strings":["Cornell University, USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043667154","display_name":"David P. Williamson","orcid":"https://orcid.org/0000-0002-2884-0058"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David P. Williamson","raw_affiliation_strings":["Cornell University, USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087614513"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":0.8058,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75802729,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"28","issue":null,"first_page":"1","last_page":"18"},"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.9991999864578247,"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.9991999864578247,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9970999956130981,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7714691162109375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6813215017318726},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6526434421539307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.580984354019165},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5368663668632507},{"id":"https://openalex.org/keywords/spectral-gap","display_name":"Spectral gap","score":0.4260636568069458},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4118233323097229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36257898807525635},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.316657692193985}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7714691162109375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6813215017318726},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6526434421539307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.580984354019165},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5368663668632507},{"id":"https://openalex.org/C2778114796","wikidata":"https://www.wikidata.org/wiki/Q7575194","display_name":"Spectral gap","level":2,"score":0.4260636568069458},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4118233323097229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36257898807525635},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.316657692193985},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3609426","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3609426","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:16553","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.19","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sea.2022.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sea.2022.19","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:16553","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2022.19","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1465199488","https://openalex.org/W1494985256","https://openalex.org/W1755257097","https://openalex.org/W1886773798","https://openalex.org/W1971316057","https://openalex.org/W1975442866","https://openalex.org/W1985123706","https://openalex.org/W2004804810","https://openalex.org/W2031481696","https://openalex.org/W2033498477","https://openalex.org/W2039389937","https://openalex.org/W2051598459","https://openalex.org/W2063665970","https://openalex.org/W2073705438","https://openalex.org/W2084732238","https://openalex.org/W2086917808","https://openalex.org/W2087038607","https://openalex.org/W2159739530","https://openalex.org/W2163428398","https://openalex.org/W2294347342","https://openalex.org/W2562729437","https://openalex.org/W2897469996","https://openalex.org/W3047949933","https://openalex.org/W3133894430","https://openalex.org/W3198872216","https://openalex.org/W4238018361"],"related_works":["https://openalex.org/W1827895227","https://openalex.org/W2950582155","https://openalex.org/W4285104409","https://openalex.org/W3204684126","https://openalex.org/W4210317843","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W189401716","https://openalex.org/W2019216770","https://openalex.org/W2574250816"],"abstract_inverted_index":{"We":[0,49,72,122],"experimentally":[1],"evaluate":[2],"the":[3,15,18,42,63,70,75,78,119,126,135,140,156],"performance":[4],"of":[5,17,155],"several":[6],"Max":[7,81],"Cut":[8,82],"approximation":[9,39,47,55,88],"algorithms.":[10],"In":[11,137],"particular,":[12],"we":[13],"compare":[14,74],"results":[16],"Goemans":[19],"and":[20,94,100,115,143],"Williamson":[21],"algorithm":[22,28,34,65,83],"using":[23,29],"semidefinite":[24],"programming":[25],"with":[26,148,153],"Trevisan\u2019s":[27],"spectral":[30,64,92,127,141],"partitioning.":[31],"The":[32,103],"former":[33],"has":[35,44,85],"a":[36,45,86,95,130],"known":[37],".878":[38],"guarantee":[40],"whereas":[41],"latter":[43],".614":[46],"guarantee.":[48],"investigate":[50],"whether":[51,62],"this":[52],"gap":[53],"in":[54,59],"guarantees":[56],"is":[57],"evident":[58],"practice":[60],"or":[61],"performs":[66],"as":[67,69],"well":[68],"SDP.":[71,136,157],"also":[73],"performances":[76],"to":[77],"standard":[79],"greedy":[80],"which":[84,150],".5":[87],"guarantee,":[89],"two":[90],"additional":[91],"algorithms,":[93],"heuristic":[96,145],"from":[97,113,118],"Burer,":[98],"Monteiro,":[99],"Zhang":[101],"(BMZ).":[102],"algorithms":[104,128,142],"are":[105,151],"tested":[106],"on":[107],"Erd\u0151s\u2013Renyi":[108],"random":[109],"graphs,":[110],"complete":[111],"graphs":[112,117],"TSPLIB,":[114],"real-world":[116],"Network":[120],"Repository.":[121],"find,":[123],"unsurprisingly,":[124],"that":[125],"provide":[129],"significant":[131],"speed":[132],"advantage":[133],"over":[134],"our":[138],"experiments,":[139],"BMZ":[144],"return":[146],"cuts":[147],"values":[149],"competitive":[152],"those":[154]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}