{"id":"https://openalex.org/W2132805234","doi":"https://doi.org/10.1145/2488608.2488675","title":"Simplex partitioning via exponential clocks and the multiway cut problem","display_name":"Simplex partitioning via exponential clocks and the multiway cut problem","publication_year":2013,"publication_date":"2013-05-28","ids":{"openalex":"https://openalex.org/W2132805234","doi":"https://doi.org/10.1145/2488608.2488675","mag":"2132805234"},"language":"en","primary_location":{"id":"doi:10.1145/2488608.2488675","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-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/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"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":true,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068494085","display_name":"Roy Schwartz","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roy Schwartz","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002590915"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":6.5257,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.97142008,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"535","last_page":"544"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/rounding","display_name":"Rounding","score":0.7564413547515869},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6368665099143982},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6217939257621765},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.554915189743042},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5176487565040588},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.516300618648529},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5062176585197449},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5024917125701904},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4965994954109192},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4816000163555145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45595788955688477},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.454008549451828},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44072359800338745},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4185609221458435},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3813430964946747},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3717605471611023},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33225709199905396},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.2480768859386444}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7564413547515869},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6368665099143982},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6217939257621765},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.554915189743042},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5176487565040588},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.516300618648529},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5062176585197449},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5024917125701904},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4965994954109192},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4816000163555145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45595788955688477},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.454008549451828},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44072359800338745},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4185609221458435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3813430964946747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3717605471611023},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33225709199905396},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2480768859386444},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2488608.2488675","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1480668222","https://openalex.org/W1964932748","https://openalex.org/W1985123706","https://openalex.org/W1985219023","https://openalex.org/W1996540180","https://openalex.org/W2010004564","https://openalex.org/W2027048490","https://openalex.org/W2043520568","https://openalex.org/W2044343300","https://openalex.org/W2048843200","https://openalex.org/W2050972259","https://openalex.org/W2052844078","https://openalex.org/W2055636480","https://openalex.org/W2061130579","https://openalex.org/W2088844265","https://openalex.org/W2096411231","https://openalex.org/W2107881198","https://openalex.org/W2119378898","https://openalex.org/W2137118456","https://openalex.org/W2141793995","https://openalex.org/W2145437676","https://openalex.org/W2150148016","https://openalex.org/W2152986618","https://openalex.org/W2156397150","https://openalex.org/W2159454021","https://openalex.org/W2167236203","https://openalex.org/W2176446742","https://openalex.org/W3009415557","https://openalex.org/W3030774092","https://openalex.org/W3121576764"],"related_works":["https://openalex.org/W3126345618","https://openalex.org/W2059496069","https://openalex.org/W2141353198","https://openalex.org/W4206993075","https://openalex.org/W2903317563","https://openalex.org/W1976250005","https://openalex.org/W1876195745","https://openalex.org/W2129497110","https://openalex.org/W2017267193","https://openalex.org/W2096411231"],"abstract_inverted_index":{"The":[0],"Multiway-Cut":[1,153],"problem":[2,8,32,154],"is":[3,13,33,37,47,61,75,125,136],"a":[4,16,23,38,50,55,69,111],"fundamental":[5],"graph":[6,46],"partitioning":[7,64,72,102],"in":[9,43],"which":[10,44,74],"the":[11,45,58,65,95,98,105,118,140,143,147,152,159],"objective":[12],"to":[14,57,63,94,104,128],"find":[15],"minimum":[17],"weight":[18],"set":[19,25],"of":[20,26,97,133,142],"edges":[21],"disconnecting":[22],"given":[24],"special":[27],"vertices":[28],"called":[29],"terminals.":[30],"This":[31,123],"NP-hard":[34],"and":[35,82],"there":[36],"well":[39],"known":[40,121,137],"geometric":[41,59,160],"relaxation":[42,60],"embedded":[48],"into":[49],"high":[51],"dimensional":[52],"simplex.":[53,66,99],"Rounding":[54],"solution":[56],"equivalent":[62],"We":[67],"present":[68],"novel":[70],"simplex":[71],"algorithm":[73,103],"based":[76],"on":[77],"em":[78],"competing":[79],"exponential":[80],"clocks":[81],"distortion.":[83],"Unlike":[84],"previous":[85],"methods,":[86],"it":[87],"utilizes":[88],"cuts":[89],"that":[90,138],"are":[91],"not":[92],"parallel":[93],"faces":[96],"Applying":[100],"this":[101],"multiway":[106],"cut":[107],"problem,":[108],"we":[109],"obtain":[110,129],"simple":[112],"(4/3)-approximation":[113],"algorithm,":[114],"thus,":[115],"improving":[116],"upon":[117],"current":[119],"best":[120,148],"result.":[122],"bound":[124],"further":[126],"pushed":[127],"an":[130],"approximation":[131,150],"factor":[132],"1.32388.":[134],"It":[135],"under":[139],"assumption":[141],"unique":[144],"games":[145],"conjecture,":[146],"possible":[149],"for":[151],"can":[155],"be":[156],"attained":[157],"via":[158],"relaxation.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":9}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}