Simple deterministic O(n log n) algorithm finding a solution of Erdős-Ginzburg-Ziv theorem.
Seokhwan ChoiHanpil KangDongjae LimPublished in: CoRR (2022)
Keyphrases
- optimal solution
- worst case
- times faster
- preprocessing
- dynamic programming
- improved algorithm
- computational cost
- learning algorithm
- solution quality
- segmentation algorithm
- iterative algorithms
- significant improvement
- objective function
- search space
- iterative procedure
- solution space
- search strategy
- genetic algorithm
- closed form
- mathematical model
- clustering method
- expectation maximization
- high accuracy
- evolutionary algorithm
- cost function
- minimum length
- global optimum
- search procedure
- locally optimal
- greedy strategy
- optimization method
- particle swarm optimization
- upper bound
- probabilistic model
- np hard
- multi objective
- search algorithm
- similarity measure