Approximation hardness of Shortest Common Superstring variants.
Yun William YuPublished in: CoRR (2016)
Keyphrases
- shortest common supersequence
- np hard
- approximation algorithms
- relative error
- computational complexity
- phase transition
- multi agent
- worst case
- graphical models
- database
- shortest path
- np complete
- gaussian convolution
- approximation schemes
- approximation error
- efficient computation
- error bounds
- closed form
- evolutionary algorithm
- image processing
- computer vision
- artificial intelligence
- machine learning
- real world