An Approximation Algorithm for the Minimum Common Supertree Problem.
Atsuko YamaguchiKoji NakanoSatoru MiyanoPublished in: Nord. J. Comput. (1997)
Keyphrases
- times faster
- preprocessing
- learning algorithm
- experimental evaluation
- cost function
- np hard
- worst case
- detection algorithm
- computational complexity
- k means
- square error
- high accuracy
- similarity measure
- improved algorithm
- global minimum
- optimization algorithm
- theoretical analysis
- computationally efficient
- linear programming
- optimal solution
- particle swarm optimization
- segmentation algorithm
- simulated annealing
- probabilistic model
- ant colony optimization
- closed form
- dynamic programming
- approximation algorithms
- search space
- minimum length
- objective function