Greedy Relaxations of the Sparsest Permutation Algorithm.
Wai-Yin LamBryan AndrewsJoseph D. RamseyPublished in: CoRR (2022)
Keyphrases
- dynamic programming
- times faster
- significant improvement
- np hard
- experimental evaluation
- detection algorithm
- computational complexity
- improved algorithm
- k means
- computational cost
- high accuracy
- segmentation algorithm
- combinatorial optimization
- classification algorithm
- tree structure
- optimization algorithm
- theoretical analysis
- neural network
- selection algorithm
- objective function
- recognition algorithm
- locally optimal
- convergence rate
- greedy algorithms
- computationally efficient
- matching algorithm
- simulated annealing
- mobile robot
- search space
- optimal solution
- learning algorithm