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
L Dagdug 2000 J. Phys.: Condens. Matter 12 9573
Kingshuk Majumdar and Manash Mukherjee 2002 J. Phys. A: Math. Gen. 35 L543
U Kaatze and K Lautscham 1986 J. Phys. E: Sci. Instrum. 19 1046
Gh-S Paraoanu et al 2001 J. Phys. B: At. Mol. Opt. Phys. 34 4763
Natasha Alves and Tom Chau 2010 Physiol. Meas. 31 461
R Lambie 1960 J. Sci. Instrum. 37 144
K Bladh et al 2005 New J. Phys. 7 180
Jeffrey L. Carlin et al 2009 ApJ 702 L9
R Gordon 2006 J. Opt. A: Pure Appl. Opt. 8 L1