A local search approximation algorithm for the multiway cut problem

DOI10.1016/j.dam.2023.05.022OpenAlexW4379622149MaRDI QIDQ6166037

Nasim Samei, Roberto Solis-Oba, Andrew Bloch-Hansen

Publication date: 2 August 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.05.022

zbMATH Keywords

local searchapproximation algorithmsmultiway cutexperimental evaluation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experimental evaluation of a local search approximation algorithm for the multiway cut problem
• Rounding algorithms for a geometric embedding of minimum multiway cut
• Recent directions in netlist partitioning: a survey
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• The Complexity of Multiterminal Cuts
• Simplex Transformations and the Multiway Cut Problem
• Local Search Heuristics for k-Median and Facility Location Problems
• Multiway cut, pairwise realizable distributions, and descending thresholds
• Simplex partitioning via exponential clocks and the multiway cut problem

This page was built for publication: A local search approximation algorithm for the multiway cut problem