Experimental evaluation of a local search approximation algorithm for the multiway cut problem
From MaRDI portal
Publication:831743
DOI10.1007/978-3-030-67899-9_28OpenAlexW3127301264MaRDI QIDQ831743FDOQ831743
Authors: Andrew Bloch-Hansen, Nasim Samei, Roberto Solis-Oba 
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_28
Recommendations
- A local search approximation algorithm for the multiway cut problem
- scientific article; zbMATH DE number 1775387
- Approximation algorithms for feasible cut and multicut problems
- Smoothed analysis of local search for the maximum-cut problem
- Smoothed Analysis of Local Search for the Maximum-Cut Problem
- scientific article; zbMATH DE number 437546
- An improved approximation algorithm of MULTIWAY CUT.
- A multiple search operator heuristic for the max-k-cut problem
- An improved parameterized algorithm for the multicut problem
- Computing and Combinatorics
Cites Work
- Title not available (Why is that?)
- Recent directions in netlist partitioning: a survey
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- The Complexity of Multiterminal Cuts
- Title not available (Why is that?)
- Simplex partitioning via exponential clocks and the multiway cut problem
- Rounding algorithms for a geometric embedding of minimum multiway cut
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local Search Heuristics for k-Median and Facility Location Problems
- Simplex transformations and the multiway cut problem
- Multiway cut, pairwise realizable distributions, and descending thresholds
Cited In (1)
This page was built for publication: Experimental evaluation of a local search approximation algorithm for the multiway cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831743)
