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
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Simplex partitioning via exponential clocks and the multiway cut problem
- Rounding algorithms for a geometric embedding of minimum multiway cut
- 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)
Recommendations
- Approximation algorithms for feasible cut and multicut problems 👍 👎
- An improved approximation algorithm of MULTIWAY CUT. 👍 👎
- A multiple search operator heuristic for the max-k-cut problem 👍 👎
- Computing and Combinatorics 👍 👎
- Smoothed Analysis of Local Search for the Maximum-Cut Problem 👍 👎
- Smoothed Analysis of Local Search for the Maximum-Cut Problem 👍 👎
- A local search approximation algorithm for the multiway cut problem 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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)
