Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2.
Sascha OttPublished in: WG (1999)
Keyphrases
- lower bound
- upper bound
- upper and lower bounds
- real time
- objective function
- pattern matching
- branch and bound algorithm
- lower and upper bounds
- social networks
- computational complexity
- worst case
- optimal cost
- running times
- small size
- vc dimension
- branch and bound
- np hard
- special case
- information systems
- learning algorithm