New lower bounds for covering codes.
Laurent HabsiegerAlain PlagnePublished in: Discret. Math. (2000)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- error correction
- branch and bound
- np hard
- upper and lower bounds
- objective function
- quadratic assignment problem
- worst case
- optimal solution
- vc dimension
- lower and upper bounds
- error correcting
- randomly generated problems
- minimum volume
- similarity measure
- linear programming relaxation
- online algorithms
- computational complexity
- lower bounding
- error correcting codes