@inproceedings{9227,
abstract = {In the multiway cut problem we are given a weighted undirected graph G=(V,E) and a set T⊆V of k terminals. The goal is to find a minimum weight set of edges E′⊆E with the property that by removing E′ from G all the terminals become disconnected. In this paper we present a simple local search approximation algorithm for the multiway cut problem with approximation ratio 2−2k . We present an experimental evaluation of the performance of our local search algorithm and show that it greatly outperforms the isolation heuristic of Dalhaus et al. and it has similar performance as the much more complex algorithms of Calinescu et al., Sharma and Vondrak, and Buchbinder et al. which have the currently best known approximation ratios for this problem.},
author = {Bloch-Hansen, Andrew and Samei, Nasim and Solis-Oba, Roberto},
booktitle = {Conference on Algorithms and Discrete Applied Mathematics},
isbn = {9783030678982},
issn = {1611-3349},
location = {Rupnagar, India},
pages = {346--358},
publisher = {Springer Nature},
title = {{Experimental evaluation of a local search approximation algorithm for the multiway cut problem}},
doi = {10.1007/978-3-030-67899-9_28},
volume = {12601},
year = {2021},
}