An $O(3.82^k)$ Time FPT Algorithm for Convex Flip Distance.
Haohong LiGe XiaPublished in: CoRR (2022)
Keyphrases
- learning algorithm
- computational complexity
- times faster
- optimization algorithm
- k means
- np hard
- linear programming
- theoretical analysis
- detection algorithm
- experimental evaluation
- convex hull
- recognition algorithm
- improved algorithm
- preprocessing
- optimal solution
- convergence rate
- distance function
- globally optimal
- multicommodity flow problems
- similarity measure
- high accuracy
- worst case
- computational cost
- dynamic programming
- cost function
- significant improvement
- search space
- objective function
- particle swarm optimization
- expectation maximization
- simulated annealing
- knn
- distance metric
- distance transform
- search algorithm
- primal dual