An improved approximation algorithm for the minimum 3-path partition problem.
Yong ChenRandy GoebelGuohui LinBing SuYao XuAn ZhangPublished in: J. Comb. Optim. (2019)
Keyphrases
- experimental evaluation
- cost function
- detection algorithm
- times faster
- preprocessing
- dynamic programming
- np hard
- expectation maximization
- recognition algorithm
- improved algorithm
- computational complexity
- optimal solution
- k means
- approximation ratio
- optimization algorithm
- probabilistic model
- path finding
- partitioning algorithm
- minimum length
- matching algorithm
- theoretical analysis
- worst case
- decision trees
- computational cost
- lower bound
- bayesian networks
- similarity measure