DocumentCode
2692732
Title
New method to the solution of maximum clique problem: mean-field approximation algorithm and its experimentation
Author
Wu, Jijun ; Harada, Tetsuya ; Fukao, Takeshi
Author_Institution
Dept. of Appl. Electron., Sci. Univ. of Tokyo, Japan
Volume
3
fYear
1994
fDate
2-5 Oct 1994
Firstpage
2248
Abstract
Our experiments show that for maximum clique problem mean-field approximation algorithm provides better results than those of simulated annealing or RaCLIQUE. For shortening computation time, we examine the characteristics of critical temperature and suggest a new way of temperature scheduling
Keywords
approximation theory; computational complexity; optimisation; RaCLIQUE; critical temperature; discrete optimisation; maximum clique problem; mean-field approximation algorithm; simulated annealing; temperature scheduling; Algorithm design and analysis; Approximation algorithms; Computational modeling; Computer networks; Concurrent computing; Equations; Neural networks; Processor scheduling; Simulated annealing; Temperature;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-2129-4
Type
conf
DOI
10.1109/ICSMC.1994.400199
Filename
400199
Link To Document