A 1.375-approximation algorithm for unsigned translocation sorting.
Lianrong PuDaming ZhuHaitao JiangPublished in: J. Comput. Syst. Sci. (2020)
Keyphrases
- learning algorithm
- cost function
- worst case
- experimental evaluation
- monte carlo
- preprocessing
- computational cost
- dynamic programming
- matching algorithm
- error bounds
- convergence rate
- significant improvement
- k means
- optimal solution
- objective function
- high accuracy
- approximation algorithms
- times faster
- approximation ratio
- tree structure
- detection algorithm
- theoretical analysis
- simulated annealing
- special case
- selection algorithm
- polygonal approximation
- reinforcement learning