A new lower bound for the critical probability of site percolation on the square lattice.
J. van den BergA. ErmakovPublished in: Random Struct. Algorithms (1996)
Keyphrases
- lower bound
- upper bound
- arbitrarily close
- website
- branch and bound algorithm
- branch and bound
- objective function
- optimal solution
- np hard
- lower and upper bounds
- sufficiently accurate
- probability distribution
- data sets
- lagrangian relaxation
- lattice structure
- worst case
- lower bounding
- upper and lower bounds
- learning algorithm