{"id":"https://openalex.org/W2346816364","doi":"https://doi.org/10.1145/2837020","title":"A Combinatorial, Primal-Dual Approach to Semidefinite Programs","display_name":"A Combinatorial, Primal-Dual Approach to Semidefinite Programs","publication_year":2016,"publication_date":"2016-05-04","ids":{"openalex":"https://openalex.org/W2346816364","doi":"https://doi.org/10.1145/2837020","mag":"2346816364"},"language":"en","primary_location":{"id":"doi:10.1145/2837020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837020","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/A5103209777","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0003-4852-691X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanjeev Arora","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5114021051","display_name":"Satyen Kale","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satyen Kale","raw_affiliation_strings":["Princeton University"],"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103209777"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":5.0577,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.95404504,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"63","issue":"2","first_page":"1","last_page":"35"},"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.9993000030517578,"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.9993000030517578,"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.9975000023841858,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9972000122070312,"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/multiplicative-function","display_name":"Multiplicative function","score":0.7284687757492065},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6579428911209106},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6354897618293762},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5898271203041077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5425428152084351},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5085288286209106},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5006692409515381},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4709673225879669},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46289435029029846},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3948117196559906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35973572731018066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32418984174728394},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32213813066482544}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7284687757492065},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6579428911209106},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6354897618293762},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5898271203041077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5425428152084351},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5085288286209106},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5006692409515381},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4709673225879669},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46289435029029846},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3948117196559906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35973572731018066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32418984174728394},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32213813066482544},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2837020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2837020","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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":49,"referenced_works":["https://openalex.org/W1505731132","https://openalex.org/W1537145174","https://openalex.org/W1544515183","https://openalex.org/W1598056440","https://openalex.org/W1963753244","https://openalex.org/W1964510837","https://openalex.org/W1985123706","https://openalex.org/W1995547833","https://openalex.org/W2002272911","https://openalex.org/W2002617302","https://openalex.org/W2006118023","https://openalex.org/W2010791033","https://openalex.org/W2016384870","https://openalex.org/W2020632401","https://openalex.org/W2023770210","https://openalex.org/W2030458698","https://openalex.org/W2037757210","https://openalex.org/W2051540665","https://openalex.org/W2067136705","https://openalex.org/W2078013954","https://openalex.org/W2099463627","https://openalex.org/W2103444054","https://openalex.org/W2104103056","https://openalex.org/W2106759055","https://openalex.org/W2109154425","https://openalex.org/W2117595194","https://openalex.org/W2120041647","https://openalex.org/W2126746199","https://openalex.org/W2127114399","https://openalex.org/W2127638566","https://openalex.org/W2130727150","https://openalex.org/W2134348739","https://openalex.org/W2134422938","https://openalex.org/W2139841919","https://openalex.org/W2145701440","https://openalex.org/W2148025043","https://openalex.org/W2150865801","https://openalex.org/W2151450177","https://openalex.org/W2158177004","https://openalex.org/W2164818780","https://openalex.org/W2164957410","https://openalex.org/W2165956524","https://openalex.org/W2208409594","https://openalex.org/W2295995314","https://openalex.org/W2296319761","https://openalex.org/W2610857016","https://openalex.org/W4250589301","https://openalex.org/W4389615669","https://openalex.org/W6635642861"],"related_works":["https://openalex.org/W4388481423","https://openalex.org/W2036562274","https://openalex.org/W2121045497","https://openalex.org/W2269291726","https://openalex.org/W2128202699","https://openalex.org/W2047623182","https://openalex.org/W2239063252","https://openalex.org/W1985090152","https://openalex.org/W4391995034","https://openalex.org/W2386411162"],"abstract_inverted_index":{"Semidefinite":[0],"programs":[1],"(SDPs)":[2],"have":[3,107],"been":[4],"used":[5,97],"in":[6,49,56,63,110],"many":[7],"recent":[8,115],"approximation":[9,71],"algorithms.":[10],"We":[11],"develop":[12],"a":[13,21,34,91],"general":[14],"primal-dual":[15,86],"approach":[16],"to":[17,30,98],"solve":[18],"SDPs":[19],"using":[20],"generalization":[22],"of":[23,36,84,94,117],"the":[24,114],"well-known":[25],"multiplicative":[26],"weights":[27],"update":[28],"rule":[29],"symmetric":[31],"matrices.":[32],"For":[33],"number":[35],"problems,":[37],"such":[38],"as":[39],"S":[40,47],"parsest":[41],"C":[42,59],"ut":[43,60],"and":[44,51,61],"B":[45],"alanced":[46],"eparator":[48],"undirected":[50],"directed":[52],"weighted":[53],"graphs,":[54],"M":[55,62],"U":[57],"n":[58],"2CNF":[64],"D":[65],"eletion":[66],",":[67],"this":[68],"yields":[69],"combinatorial":[70],"algorithms":[72,87,96],"that":[73,122],"are":[74],"significantly":[75],"more":[76],"efficient":[77],"than":[78],"interior":[79],"point":[80],"methods.":[81],"The":[82],"design":[83],"our":[85],"is":[88],"guided":[89],"by":[90],"robust":[92],"analysis":[93],"rounding":[95],"obtain":[99],"integer":[100],"solutions":[101],"from":[102],"fractional":[103],"ones.":[104],"Our":[105],"ideas":[106],"proved":[108],"useful":[109],"quantum":[111],"computing,":[112],"especially":[113],"result":[116],"Jain":[118],"et":[119],"al.":[120],"[2011]":[121],"QIP":[123],"=":[124],"PSPACE.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}