{"id":"https://openalex.org/W2883925562","doi":"https://doi.org/10.1137/15m1045521","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":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2883925562","doi":"https://doi.org/10.1137/15m1045521","mag":"2883925562"},"language":"en","primary_location":{"id":"doi:10.1137/15m1045521","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1045521","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/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Niv Buchbinder","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097149856","display_name":"Joseph Seffi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph Seffi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068494085","display_name":"Roy Schwartz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roy Schwartz","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002590915"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6058,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.70056497,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"47","issue":"4","first_page":"1463","last_page":"1482"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.9983999729156494,"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.9983999729156494,"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/simplex","display_name":"Simplex","score":0.7077144980430603},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6010524034500122},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.48168763518333435},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47651898860931396},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4463900625705719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42664000391960144},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.4136381447315216},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3960994482040405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3671579360961914},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3572140336036682},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.2606479823589325}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7077144980430603},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6010524034500122},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.48168763518333435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47651898860931396},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4463900625705719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42664000391960144},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.4136381447315216},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3960994482040405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3671579360961914},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3572140336036682},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2606479823589325},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m1045521","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1045521","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3153983870","display_name":null,"funder_award_id":"2014414","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G6087480520","display_name":null,"funder_award_id":"1585/15","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1964932748","https://openalex.org/W1985123706","https://openalex.org/W1985219023","https://openalex.org/W1994294861","https://openalex.org/W1996540180","https://openalex.org/W2010004564","https://openalex.org/W2043520568","https://openalex.org/W2044343300","https://openalex.org/W2050972259","https://openalex.org/W2055636480","https://openalex.org/W2061130579","https://openalex.org/W2088844265","https://openalex.org/W2107881198","https://openalex.org/W2137118456","https://openalex.org/W2150148016","https://openalex.org/W2152986618","https://openalex.org/W2159454021","https://openalex.org/W2167236203","https://openalex.org/W2176446742","https://openalex.org/W3009415557","https://openalex.org/W3030774092"],"related_works":["https://openalex.org/W2390764738","https://openalex.org/W2501873806","https://openalex.org/W3181368311","https://openalex.org/W2998961919","https://openalex.org/W2027241495","https://openalex.org/W2385011829","https://openalex.org/W3217624969","https://openalex.org/W1591154254","https://openalex.org/W2883925562","https://openalex.org/W2054252354"],"abstract_inverted_index":{"The":[0],"\\sf":[1,153],"Multiway-Cut":[2,154],"problem":[3,9,33,155],"is":[4,14,34,38,47,61,75,125,136],"a":[5,17,24,39,50,55,69,112],"fundamental":[6],"graph":[7,46],"partitioning":[8,64,72,103],"in":[10,43],"which":[11,44,74],"the":[12,45,58,65,96,99,106,119,140,143,147,152,160],"objective":[13],"to":[15,57,63,95,105,128],"find":[16],"minimum":[18],"weight":[19],"set":[20,26],"of":[21,27,98,133,142],"edges":[22],"disconnecting":[23],"given":[25],"special":[28],"vertices":[29],"called":[30],"terminals.":[31],"This":[32,123],"NP-hard":[35],"and":[36,83],"there":[37],"well-known":[40],"geometric":[41,59,161],"relaxation":[42,60],"embedded":[48],"into":[49],"high":[51],"dimensional":[52],"simplex.":[53,66,100],"Rounding":[54],"solution":[56],"equivalent":[62],"We":[67],"present":[68],"novel":[70],"simplex":[71],"algorithm":[73,104],"based":[76],"on":[77],"two":[78],"ingredients:":[79],"competing":[80],"exponential":[81],"clocks":[82],"distortion.":[84],"Unlike":[85],"previous":[86],"methods,":[87],"it":[88],"utilizes":[89],"cuts":[90],"that":[91,138],"are":[92],"not":[93],"parallel":[94],"faces":[97],"Applying":[101],"this":[102],"multiway":[107],"cut":[108],"problem,":[109],"we":[110],"obtain":[111,129],"simple":[113],"(4/3)-approximation":[114],"algorithm,":[115],"thus,":[116],"improving":[117],"upon":[118],"current":[120],"best-known":[121],"result.":[122],"bound":[124],"further":[126],"pushed":[127],"an":[130],"approximation":[131,150],"factor":[132],"1.32388.":[134],"It":[135],"known":[137],"under":[139],"assumption":[141],"unique":[144],"games":[145],"conjecture,":[146],"best":[148],"possible":[149],"for":[151],"can":[156],"be":[157],"attained":[158],"via":[159],"relaxation.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}