{"id":"https://openalex.org/W2070514342","doi":"https://doi.org/10.5555/545381.545449","title":"MAX CUT in cubic graphs","display_name":"MAX CUT in cubic graphs","publication_year":2002,"publication_date":"2002-01-06","ids":{"openalex":"https://openalex.org/W2070514342","doi":"https://doi.org/10.5555/545381.545449","mag":"2070514342"},"language":"en","primary_location":{"id":"mag:2070514342","doi":"https://doi.org/10.5555/545381.545449","is_oa":false,"landing_page_url":"http://www.cs.tau.ac.il/%7Ezwick/papers/cubic-MAXCUT-SODA.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","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":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"volume":null,"type":"conference-paper","indexed_in":[],"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/A5050273239","display_name":"Eran Halperin","orcid":"https://orcid.org/0000-0002-2373-3691","observed_orcids":["https://orcid.org/0000-0002-2373-3691"]},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eran Halperin","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":"https://orcid.org/0000-0002-2373-3691","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051176197","display_name":"Dror Livnat","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dror Livnat","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710","observed_orcids":["https://orcid.org/0000-0002-7638-7710"]},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uri Zwick","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":"https://orcid.org/0000-0002-7638-7710","affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.4917,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.57149357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"506","last_page":"513"},"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.9970999956130981,"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.9970999956130981,"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.0015999999595806003,"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.00039999998989515007,"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/max-cut","display_name":"MaxCut","score":0.878000020980835},{"id":"https://openalex.org/keywords/cubic-graphs","display_name":"cubic graphs","score":0.9929999709129333},{"id":"https://openalex.org/keywords/maximum-degree-3","display_name":"maximum degree 3","score":0.7059999704360962},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"semidefinite programming","score":0.9309999942779541},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9710000157356262},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.8989999890327454},{"id":"https://openalex.org/keywords/combinatorial-approximation","display_name":"combinatorial approximation","score":0.847000002861023},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.6710000038146973}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7273024320602417},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6591643691062927},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.648201048374176},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6006127595901489},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5873563289642334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5709750652313232},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5265538692474365},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.5077406167984009},{"id":"https://openalex.org/C134121241","wikidata":"https://www.wikidata.org/wiki/Q899301","display_name":"Yield (engineering)","level":2,"score":0.45926985144615173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40949195623397827},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.312664657831192},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16154614090919495},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09528958797454834},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07606139779090881},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2070514342","doi":"https://doi.org/10.5555/545381.545449","is_oa":false,"landing_page_url":"http://www.cs.tau.ac.il/%7Ezwick/papers/cubic-MAXCUT-SODA.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","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":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1527607312","https://openalex.org/W1564025554","https://openalex.org/W1599005792","https://openalex.org/W1985123706","https://openalex.org/W1987579904","https://openalex.org/W2026820987","https://openalex.org/W2035016254","https://openalex.org/W2053877774","https://openalex.org/W2091260378","https://openalex.org/W2109041494","https://openalex.org/W2137373403","https://openalex.org/W2146489710"],"related_works":["https://openalex.org/W2113647243","https://openalex.org/W1599005792","https://openalex.org/W956804560","https://openalex.org/W2010791033","https://openalex.org/W1756950477","https://openalex.org/W4221151477","https://openalex.org/W1494985256","https://openalex.org/W3158455739","https://openalex.org/W7109961940","https://openalex.org/W7096539615"],"abstract_inverted_index":{"We":[0,46],"present":[1],"an":[2],"improved":[3,70],"semidefinite":[4],"programming":[5],"based":[6],"approximation":[7,23],"algorithm":[8,28,65],"for":[9,66],"the":[10,26,67,75,79],"MAX":[11],"CUT":[12],"problem":[13],"in":[14,74],"graphs":[15],"of":[16,25,41,51,56,78],"maximum":[17],"degree":[18],"at":[19,30],"most":[20],"3.":[21],"The":[22],"ratio":[24],"new":[27],"is":[29],"least":[31],"0.9326.":[32],"This":[33],"improves,":[34],"and":[35,44,53,55,58],"also":[36,47],"somewhat":[37],"simplifies,":[38],"a":[39,61],"result":[40],"Feige,":[42],"Karpinski":[43],"Langberg.":[45],"observe":[48],"that":[49],"results":[50,71],"Hopkins":[52],"Staton":[54],"Bondy":[57],"Locke":[59],"yield":[60],"simple":[62],"combinatorial":[63],"4/5-approximation":[64],"problem.":[68],"Slightly":[69],"would":[72],"appear":[73],"full":[76],"version":[77],"paper.":[80]},"counts_by_year":[],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}