A Lower Bound for {a+b: a in A, b in B, and P(a, b) != 0}.
Hao PanZhi-Wei SunPublished in: J. Comb. Theory, Ser. A (2002)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- worst case
- lower and upper bounds
- optimal solution
- sufficiently accurate
- lower bounding
- upper and lower bounds
- sample complexity
- information retrieval
- machine learning
- data sets
- competitive ratio
- branch and bound method
- database
- probabilistic model
- vc dimension
- databases
- lagrangian relaxation
- linear programming relaxation