A local search approximation algorithm for the multiway cut problem.
Andrew Bloch-HansenNasim SameiRoberto Solis-ObaPublished in: Discret. Appl. Math. (2023)
Keyphrases
- optimal solution
- experimental evaluation
- learning algorithm
- computational complexity
- cost function
- times faster
- search space
- error bounds
- objective function
- theoretical analysis
- particle swarm optimization
- detection algorithm
- worst case
- significant improvement
- k means
- computational cost
- dynamic programming
- memetic algorithm
- preprocessing
- search algorithm
- combinatorial optimization
- error tolerance
- approximation ratio
- global search
- search procedure
- benchmark problems
- convergence rate
- similarity measure
- convex hull
- closed form
- tree structure
- ant colony optimization
- optimization algorithm
- segmentation algorithm
- genetic algorithm
- simulated annealing
- markov random field
- high accuracy