Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
Mingyu XiaoLeizhen CaiAndrew C. YaoPublished in: CoRR (2008)
Keyphrases
- approximation ratio
- special case
- np hard
- dynamic programming
- worst case
- experimental evaluation
- greedy algorithm
- times faster
- globally optimal
- locally optimal
- significant improvement
- greedy heuristic
- detection algorithm
- optimization algorithm
- greedy algorithms
- expectation maximization
- cost function
- k means
- search space
- lower bound
- computational complexity
- search algorithm
- neural network
- preprocessing
- optimal solution
- randomized algorithms
- square error
- shortest path
- theoretical analysis
- particle swarm optimization
- simulated annealing
- evolutionary algorithm