An efficient algorithm for a special case of the set partition problem.
Alan JacksonPrakash RamananPublished in: Int. J. Comput. Math. (1990)
Keyphrases
- special case
- theoretical analysis
- computational complexity
- dynamic programming
- cost function
- learning algorithm
- decomposition algorithm
- input data
- np hard
- times faster
- detection algorithm
- initial set
- convex hull
- matching algorithm
- search space
- conflict free
- improved algorithm
- high accuracy
- k means
- optimal solution
- experimental evaluation
- optimization algorithm
- simulated annealing
- tree structure
- classification algorithm
- objective function
- probability distribution
- computational cost
- solution space
- segmentation algorithm
- lower and upper bounds
- genetic algorithm
- computationally efficient
- similarity measure