Lower bounds on covering codes via partition matrices.
Wolfgang HaasJan-Christoph Schlage-PuchtaJörn QuistorffPublished in: J. Comb. Theory, Ser. A (2009)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- upper and lower bounds
- error correction
- singular value decomposition
- np hard
- worst case
- lower and upper bounds
- randomly generated problems
- coefficient matrix
- objective function
- logical operations
- error control
- error correcting codes
- pairwise comparison
- lower bounding
- quadratic assignment problem
- linear programming relaxation
- pairwise
- search space
- vc dimension
- knapsack problem
- original data