On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem.
Dirk BongartzPublished in: SOFSEM (2000)
Keyphrases
- approximation ratio
- np hard
- computational cost
- high accuracy
- worst case
- improved algorithm
- computational complexity
- computationally efficient
- mobile robot
- dynamic programming
- objective function
- estimation algorithm
- preprocessing
- optimal solution
- experimental evaluation
- simulated annealing
- selection algorithm
- recognition algorithm
- greedy algorithm
- path planning
- linear programming
- times faster
- clustering method
- shortest path
- detection algorithm
- segmentation algorithm
- theoretical analysis
- expectation maximization
- particle swarm optimization
- genetic algorithm
- probabilistic model
- search space
- learning algorithm