A local search 4/3-approximation algorithm for the minimum 3-path partition problem.
Yong ChenRandy GoebelGuohui LinLongcheng LiuBing SuWeitian TongYao XuAn ZhangPublished in: J. Comb. Optim. (2022)
Keyphrases
- search space
- optimal solution
- experimental evaluation
- preprocessing
- simulated annealing
- worst case
- detection algorithm
- clustering method
- shortest path problem
- recognition algorithm
- dynamic programming
- benchmark problems
- square error
- constant factor
- search algorithm
- optimal path
- hill climbing
- computational complexity
- approximation algorithms
- objective function
- significant improvement
- closed form
- combinatorial optimization
- error bounds
- matching algorithm
- search procedure
- minimum cost
- optimization algorithm
- particle swarm optimization
- cost function
- approximation ratio
- np hard
- polynomial time approximation
- computational cost