A 2½-Approximation Algorithm for Shortest Superstring.
Z. SweedykPublished in: SIAM J. Comput. (1999)
Keyphrases
- preprocessing
- simulated annealing
- cost function
- dynamic programming
- experimental evaluation
- detection algorithm
- improved algorithm
- computational complexity
- error bounds
- times faster
- theoretical analysis
- linear programming
- objective function
- path length
- optimization algorithm
- worst case
- computational cost
- np hard
- learning algorithm
- high accuracy
- probabilistic model
- clustering method
- classification algorithm
- approximation algorithms
- optimal solution