An O(n2) time algorithm for the minimal permutation completion problem.
Christophe CrespelleAnthony PerezIoan TodincaPublished in: Discret. Appl. Math. (2019)
Keyphrases
- dynamic programming
- optimal solution
- experimental evaluation
- computational cost
- preprocessing
- cost function
- np hard
- learning algorithm
- single pass
- theoretical analysis
- expectation maximization
- high accuracy
- detection algorithm
- computationally efficient
- experimental study
- times faster
- worst case
- improved algorithm
- k means
- clustering method
- simulated annealing
- optimization algorithm
- input data
- linear programming
- probabilistic model
- similarity measure