Lower Bound for the Connective Constant of a Self-Avoiding Walk on a Square Lattice.
W. A. BeyerM. B. WellsPublished in: J. Comb. Theory, Ser. A (1972)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- constant factor
- lower and upper bounds
- optimal solution
- np hard
- worst case
- lattice structure
- lower bounding
- upper and lower bounds
- concept lattice
- arbitrarily close
- sufficiently accurate
- data sets
- random walk
- branch and bound method
- linear programming relaxation
- objective function
- concept classes
- linear programming
- polynomial approximation
- information systems