Abstract
The maximum independent set problem is a classic graph optimization problem. It is well known that it is an NP-Complete problem. In this paper, an improved simulated annealing algorithm is presented for the maximum independent set problem. In this algorithm, an acceptance function is defined for every vertex. This can help the algorithm find a near optimal solution to a problem. Simulations are performed on benchmark graphs and random graphs. The simulation results show that the proposed algorithm provides a high probability of finding optimal solutions. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Xu, X., Ma, J., & Wang, H. (2006). An improved simulated annealing algorithm for the maximum independent set problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4113 LNCS-I, pp. 822–831). Springer Verlag. https://doi.org/10.1007/11816157_99
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
