Experimental evaluation of a local search approximation algorithm for the multiway cut problem
From MaRDI portal
(Redirected from Publication:831743)
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
- 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?)
- 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
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)
