{"id":"https://openalex.org/W2043506441","doi":"https://doi.org/10.1137/s0097539796309326","title":"Derandomizing Approximation Algorithms Based on Semidefinite Programming","display_name":"Derandomizing Approximation Algorithms Based on Semidefinite Programming","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2043506441","doi":"https://doi.org/10.1137/s0097539796309326","mag":"2043506441"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796309326","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796309326","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/A5113496239","display_name":"Sanjeev Mahajan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanjeev Mahajan","raw_affiliation_strings":["LSI Logic, Milpitas, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LSI Logic, Milpitas, CA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113688016","display_name":"H. Ramesh","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"H. Ramesh","raw_affiliation_strings":["Indian Institute of Science, Bangalore, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Science, Bangalore, India","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.8184,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.9817812,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"28","issue":"5","first_page":"1641","last_page":"1663"},"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.9998999834060669,"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.9998999834060669,"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.9988999962806702,"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.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7204501032829285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6866428256034851},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5849958062171936},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5691158771514893},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5566535592079163},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5171663165092468},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5028402209281921},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.48858508467674255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44661444425582886},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42154043912887573},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38646334409713745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1401868462562561},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13984328508377075}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7204501032829285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6866428256034851},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5849958062171936},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5691158771514893},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5566535592079163},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5171663165092468},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5028402209281921},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.48858508467674255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44661444425582886},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42154043912887573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38646334409713745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1401868462562561},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13984328508377075},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539796309326","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796309326","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"},{"id":"pmh:oai:eprints.iisc.ac.in:63","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196309","display_name":"NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59270414","host_organization_name":"Indian Institute of Science Bangalore","host_organization_lineage":["https://openalex.org/I59270414"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.109.2354","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.2354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eprints.iisc.ernet.in/archive/00000063/01/MAHAJAN.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.1519","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.1519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drona.csa.iisc.ernet.in/~ramesh/psfiles/8.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W9575391","https://openalex.org/W1483204526","https://openalex.org/W1519375772","https://openalex.org/W1982506822","https://openalex.org/W1985123706","https://openalex.org/W2001564241","https://openalex.org/W2011869755","https://openalex.org/W2036660814","https://openalex.org/W2069816168","https://openalex.org/W2089247135","https://openalex.org/W2100440346","https://openalex.org/W2104254886","https://openalex.org/W2109039359","https://openalex.org/W2153663865","https://openalex.org/W2179016037","https://openalex.org/W2493844837","https://openalex.org/W2751862591","https://openalex.org/W3011766368","https://openalex.org/W4236977434","https://openalex.org/W4285719527","https://openalex.org/W4293860921"],"related_works":["https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4234010763","https://openalex.org/W2888826740","https://openalex.org/W4299801389","https://openalex.org/W2005018956","https://openalex.org/W2463505734","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W2099734427"],"abstract_inverted_index":{"Remarkable":[0],"breakthroughs":[1,30],"have":[2],"been":[3],"made":[4],"recently":[5],"in":[6,102,122],"obtaining":[7,62],"approximate":[8],"solutions":[9],"to":[10,53,88,105],"some":[11],"fundamental":[12],"NP-hard":[13],"problems,":[14],"namely":[15],"Max-Cut,":[16],"Max":[17],"k-Cut,":[18],"Max-Sat,":[19],"Max-Dicut,":[20],"Max-bisection,":[21],"k-vertex":[22],"coloring,":[23],"maximum":[24],"independent":[25],"set,":[26],"etc.":[27],"All":[28],"these":[29],"involve":[31],"polynomial":[32,63,103,123],"time":[33,64],"randomized":[34,59],"algorithms":[35,66],"based":[36],"upon":[37],"semidefinite":[38],"programming,":[39],"a":[40,90,106,111],"technique":[41,81],"pioneered":[42],"by":[43],"Goemans":[44],"and":[45],"Williamson.":[46],"In":[47],"this":[48],"paper,":[49],"we":[50],"give":[51],"techniques":[52],"derandomize":[54],"the":[55,68,73,77,83],"above":[56,74],"class":[57],"of":[58,79,85,93,109,114],"algorithms,":[60],"thus":[61],"deterministic":[65],"with":[67],"same":[69],"approximation":[70],"ratios":[71],"for":[72],"problems.":[75],"At":[76],"heart":[78],"our":[80],"is":[82],"use":[84],"spherical":[86],"symmetry":[87],"convert":[89],"nested":[91,107],"sequence":[92,108],"n":[94],"integrations,":[95,115],"which":[96,116],"cannot":[97],"be":[98,118],"approximated":[99,119],"sufficiently":[100,120],"well":[101,121],"time,":[104],"just":[110],"constant":[112],"number":[113],"can":[117],"time.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}