A local search approximation algorithm for the multiway cut problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 1342124 (Why is no real title available?)
- scientific article; zbMATH DE number 1775387 (Why is no real title available?)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem
- Local Search Heuristics for k-Median and Facility Location Problems
- Multiprocessor Scheduling with the Aid of Network Flow Algorithms
- Multiway cut, pairwise realizable distributions, and descending thresholds
- Recent directions in netlist partitioning: a survey
- Simplex partitioning via exponential clocks and the multiway cut problem
- Simplex transformations and the multiway cut problem
- The Complexity of Multiterminal Cuts
Cited in
(4)- Experimental evaluation of a local search approximation algorithm for the multiway cut problem
- Local algorithms for maximum cut and minimum bisection on locally treelike regular graphs of large degree
- An improved approximation algorithm of MULTIWAY CUT.
- Smoothed Analysis of Local Search for the Maximum-Cut Problem
This page was built for publication: 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 Q6166037)