> 4: an improved lower bound on the growth constant of polyominoes.
Gill BarequetGünter RoteMira ShalahPublished in: Commun. ACM (2016)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- np hard
- constant factor
- worst case
- branch and bound
- lagrangian relaxation
- lower bounding
- optimal solution
- real time
- growth rate
- search algorithm
- objective function
- learning algorithm
- machine learning
- upper and lower bounds
- arbitrarily close
- horizontal and vertical projections
- online algorithms
- linear programming relaxation
- scheduling problem
- case study
- information systems
- genetic algorithm
- data sets