A polynomial-time algorithm for finding zero-sums.
Alberto Del LungoClaudio MariniElisa MoriPublished in: Discret. Math. (2009)
Keyphrases
- times faster
- preprocessing
- experimental evaluation
- computational complexity
- worst case
- dynamic programming
- detection algorithm
- improved algorithm
- classification algorithm
- cost function
- np hard
- segmentation algorithm
- computational cost
- convex hull
- special case
- k means
- convergence rate
- tree structure
- clustering method
- learning algorithm
- polynomial time complexity
- theoretical analysis
- computationally efficient
- simulated annealing
- high accuracy
- probability distribution
- multi objective
- significant improvement
- similarity measure
- decision trees