A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems.
Gergely CsájiPublished in: CoRR (2023)
Keyphrases
- wide range
- times faster
- benchmark problems
- preprocessing
- dynamic programming
- computational cost
- segmentation algorithm
- np hard
- cost function
- learning algorithm
- real world
- objective function
- experimental evaluation
- theoretical analysis
- computationally efficient
- k means
- matching algorithm
- high accuracy
- approximation ratio
- similarity measure
- optimal solution
- optimization algorithm
- convergence rate
- error bounds
- computational complexity
- improved algorithm
- recognition algorithm
- optimal or near optimal
- convex hull
- neural network
- closed form
- monte carlo
- energy function
- particle swarm optimization
- input data
- linear programming
- optimization problems
- search space