Experimental evaluation of a local search approximation algorithm for the multiway cut problem

DOI10.1007/978-3-030-67899-9_28OpenAlexW3127301264MaRDI QIDQ831743

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

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_28

zbMATH Keywords

approximation algorithmsmultiway cutexperimental evaluation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

A local search approximation algorithm for the multiway cut problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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: Experimental evaluation of a local search approximation algorithm for the multiway cut problem