A sharper lower bound on Rankin's constant.
Kang LiFengjun XiaoBingpeng ZhouJinming WenPublished in: Inf. Process. Lett. (2023)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- arbitrarily close
- worst case
- objective function
- optimal solution
- lower and upper bounds
- np hard
- upper and lower bounds
- piecewise smooth
- constant factor
- sufficiently accurate
- neural network
- data mining
- data structure
- linear programming relaxation
- sample complexity
- average case
- interpolation method
- polynomial approximation
- data sets