A local search 4/3-approximation algorithm for the minimum 3-path partition problem.
Yong ChenRandy GoebelGuohui LinLongcheng LiuBing SuWeitian TongYao XuAn ZhangPublished in: CoRR (2018)
Keyphrases
- optimal solution
- experimental evaluation
- search space
- cost function
- dynamic programming
- computational complexity
- k means
- computational cost
- significant improvement
- np hard
- linear programming
- learning algorithm
- worst case
- error bounds
- recognition algorithm
- memetic algorithm
- simulated annealing
- matching algorithm
- closed form
- constant factor
- detection algorithm
- segmentation algorithm
- preprocessing
- energy function
- ant colony optimization
- combinatorial optimization
- lower bound
- search procedure
- hill climbing
- bayesian networks
- shortest path problem
- evolutionary search
- clustering algorithm