Lower Bounds for q-ary Coverings by Spheres of Radius One.
Laurent HabsiegerPublished in: J. Comb. Theory, Ser. A (1994)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- rough sets
- objective function
- branch and bound
- lower bounding
- lower and upper bounds
- set of randomly generated instances
- vc dimension
- worst case
- optimal solution
- upper and lower bounds
- data sets
- data analysis
- equivalence relation
- linear programming relaxation
- quadratic assignment problem
- neural network
- search algorithm
- data structure
- sample complexity
- information systems