A K Hartmann et al 2008 J. Phys.: Conf. Ser. 95 012011 doi:10.1088/1742-6596/95/1/012011
A K Hartmann1, A Mann2 and W Radenbach3
Show affiliationsWe study numerically the cluster structure of random ensembles of two NP-hard optimization problems originating in computational complexity, the vertex-cover problem and the number partitioning problem. We use branch-and-bound type algorithms to obtain exact solutions of these problems for moderate system sizes. Using two methods, direct neighborhood-based clustering and hierarchical clustering, we investigate the structure of the solution space. The main result is that the correspondence between solution structure and the phase diagrams of the problems is not unique. Namely, for vertex cover we observe a drastic change of the solution space from large single clusters to multiple nested levels of clusters. In contrast, for the number-partitioning problem, the phase space looks always very simple, similar to a random distribution of the lowest-energy configurations. This holds in the ''easy''/solvable phase as well as in the ''hard''/unsolvable phase.
05.40.-a Fluctuation phenomena, random processes, noise, and Brownian motion
05.20.-y Classical statistical mechanics
Issue 1 (2008)
A K Hartmann et al 2008 J. Phys.: Conf. Ser. 95 012011
Dong Qing-Rui 2008 J. Phys. D: Appl. Phys. 41 055105
Changhyun Ahn and Yutaka Ookouchi JHEP02(2004)009
Eung Jin Chun JHEP12(2009)055
A. J. Weinberger et al. 1999 The Astronomical Journal 117 2748
O Guyétand et al 2008 J. Phys. B: At. Mol. Opt. Phys. 41 051002
T K Sindhu et al 2008 Nanotechnology 19 025703
M J Mallon et al 2008 J. Phys. B: At. Mol. Opt. Phys. 41 015501
Tudor Dan Dimofte JHEP09(2008)064
G Ratel et al 2004 Metrologia 41 06001