Stefan Boettcher 1999 J. Phys. A: Math. Gen. 32 5201 doi:10.1088/0305-4470/32/28/302
Stefan Boettcher
Show affiliationsThe benefits of a recently proposed method to approximate hard optimization problems are demonstrated on the graph partitioning problem. The performance of this new method, called extremal optimization (EO), is compared with simulated annealing (SA) in extensive numerical simulations. While generally a complex (NP-hard) problem, the optimization of the graph partitions is particularly difficult for sparse graphs with average connectivities near the percolation threshold. At this threshold, the relative error of SA for large graphs is found to diverge relative to EO at equalized runtime. On the other hand, EO, based on the extremal dynamics of self-organized critical systems, reproduces known results about optimal partitions at this critical point quite well.
65K10 Optimization and variational techniques (See also 49Mxx, 93B40)
Issue 28 (16 July 1999)
Received 12 January 1999
Stefan Boettcher 1999 J. Phys. A: Math. Gen. 32 5201
Harm van der Heijden and Joost van der Mullen 2002 J. Phys. D: Appl. Phys. 35 2112
George Horton and Chris Dewdney 2004 J. Phys. A: Math. Gen. 37 11935
Yeong E Kim and Alexander L Zubarev 2005 J. Phys. B: At. Mol. Opt. Phys. 38 L243
P Albers et al 2000 J. Phys.: Condens. Matter 12 4451
Y Abou-Ali et al 2003 J. Phys. B: At. Mol. Opt. Phys. 36 4097