An Approximation Algorithm for Sorting by Bounded Singleton Moves.
Shengjun XieHaodi FengHaitao JiangJunfeng LuanDaming ZhuPublished in: COCOON (2019)
Keyphrases
- learning algorithm
- times faster
- optimal solution
- preprocessing
- high accuracy
- dynamic programming
- objective function
- detection algorithm
- np hard
- cost function
- k means
- computational complexity
- probabilistic model
- worst case
- simulated annealing
- optimization algorithm
- search space
- path planning
- closed form
- linear programming
- clustering method
- matching algorithm
- error bounds
- approximation ratio