An improved lower bound on the growth constant of polyiamonds.
Gill BarequetMira ShalahYufei ZhengPublished in: J. Comb. Optim. (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- constant factor
- np hard
- optimal solution
- branch and bound
- lower and upper bounds
- worst case
- growth rate
- lagrangian relaxation
- upper and lower bounds
- arbitrarily close
- information systems
- sample complexity
- sufficiently accurate
- vc dimension
- special case
- image sequences
- database systems
- neural network
- databases