Improved Lower Bounds for the Shortest Superstring and Related Problems.
Marek KarpinskiRichard SchmiedPublished in: Electron. Colloquium Comput. Complex. (2011)
Keyphrases
- related problems
- lower bound
- upper bound
- broadly applicable
- objective function
- range searching
- biomedical ontologies
- np hard
- vc dimension
- branch and bound
- branch and bound algorithm
- improved algorithm
- stable marriage
- lower and upper bounds
- linear programming
- data structure
- shortest path
- theoretical analysis
- multi dimensional
- worst case
- neural network