A simple algorithm for the multiway cut problem

Niv Buchbinder; Roy Schwartz; Baruch Weizman

doi:https://doi.org/10.1016/j.orl.2019.09.012

A simple algorithm for the multiway cut problem

Niv Buchbinder, Roy Schwartz, Baruch Weizman

Tel Aviv University, Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

MULTIWAY CUT is a classic graph partitioning problem in which the goal is to disconnect a given set of special vertices called terminals. This problem admits a rich sequence of works. Unfortunately, most of these works resort to the mix of multiple algorithmic components, resulting in both complicated algorithms and analysis. We present a simple algorithm for the MULTIWAY CUT problem that is comprised of a single algorithmic component and achieves an approximation of [Formula presented].

Original language	English
Pages (from-to)	587-593
Number of pages	7
Journal	Operations Research Letters
Volume	47
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2019.09.012
State	Published - Nov 2019

Keywords

Approximation algorithms
Multiway cut
Randomized rounding
Simplex transformation

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

https://doi.org/10.1016/j.orl.2019.09.012

Cite this

@article{7247e1203af243b5b007750bccdbdc38,

title = "A simple algorithm for the multiway cut problem",

abstract = "MULTIWAY CUT is a classic graph partitioning problem in which the goal is to disconnect a given set of special vertices called terminals. This problem admits a rich sequence of works. Unfortunately, most of these works resort to the mix of multiple algorithmic components, resulting in both complicated algorithms and analysis. We present a simple algorithm for the MULTIWAY CUT problem that is comprised of a single algorithmic component and achieves an approximation of [Formula presented].",

keywords = "Approximation algorithms, Multiway cut, Randomized rounding, Simplex transformation",

author = "Niv Buchbinder and Roy Schwartz and Baruch Weizman",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier B.V.",

year = "2019",

month = nov,

doi = "https://doi.org/10.1016/j.orl.2019.09.012",

language = "الإنجليزيّة",

volume = "47",

pages = "587--593",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - A simple algorithm for the multiway cut problem

AU - Buchbinder, Niv

AU - Schwartz, Roy

AU - Weizman, Baruch

PY - 2019/11

Y1 - 2019/11

N2 - MULTIWAY CUT is a classic graph partitioning problem in which the goal is to disconnect a given set of special vertices called terminals. This problem admits a rich sequence of works. Unfortunately, most of these works resort to the mix of multiple algorithmic components, resulting in both complicated algorithms and analysis. We present a simple algorithm for the MULTIWAY CUT problem that is comprised of a single algorithmic component and achieves an approximation of [Formula presented].

AB - MULTIWAY CUT is a classic graph partitioning problem in which the goal is to disconnect a given set of special vertices called terminals. This problem admits a rich sequence of works. Unfortunately, most of these works resort to the mix of multiple algorithmic components, resulting in both complicated algorithms and analysis. We present a simple algorithm for the MULTIWAY CUT problem that is comprised of a single algorithmic component and achieves an approximation of [Formula presented].

KW - Approximation algorithms

KW - Multiway cut

KW - Randomized rounding

KW - Simplex transformation

UR - http://www.scopus.com/inward/record.url?scp=85073561997&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.orl.2019.09.012

DO - https://doi.org/10.1016/j.orl.2019.09.012

M3 - مقالة

SN - 0167-6377

VL - 47

SP - 587

EP - 593

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

A simple algorithm for the multiway cut problem

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this