Explicit Inapproximability Bounds for the Shortest Superstring Problem.
Virginia VassilevskaPublished in: MFCS (2005)
Keyphrases
- upper bound
- upper and lower bounds
- shortest path
- lower bound
- approximation algorithms
- error bounds
- average case
- worst case bounds
- distribution free
- worst case
- multiscale
- information retrieval
- domain knowledge
- search algorithm
- bayesian networks
- image segmentation
- social networks
- real world
- generalization bounds
- data sets
- confidence bounds
- database