Cluster-exact approximation of spin glass groundstates

We present a fast (similar to O(N-3)) algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of the selected spins, For the spin-cluster a groundstate is exactly calculated by using graphtheoretical methods. The other spins remain unchanged. This procedure is repeated many times resulting in a state of low energy. The total time complexity of this scheme is approximately cubic, To demonstrate how deep in energy this algorithm can get, we applied it to the +/-J model, We estimate that the groundstate energy density of the infinite system is -1.400 +/- 0.005 (2d) and -1.766 +/- 0.002 (3d), Finally the distribution of overlaps for selected systems is calculated in order to characterize the algorithm.