An improved simulated annealing algorithm for the maximum independent set problem

Authors:
Xinshun Xu;Jun Ma;Hua Wang
Affiliations:
School of Computer Science and Technology, Shandong University, Jinan, Shandong, China;School of Computer Science and Technology, Shandong University, Jinan, Shandong, China;School of Computer Science and Technology, Shandong University, Jinan, Shandong, China
Venue:
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Year:
2006

Citing 12
Cited 1

A fast parallel algorithm for the maximal independent set problem

Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem

Journal of Algorithms
A new parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
Constructing a maximal independent set in parallel

SIAM Journal on Discrete Mathematics
An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3

Information Processing Letters
An efficient parallel algorithm that finds independent sets of guaranteed size

SIAM Journal on Discrete Mathematics
A New Technique for Optimization Problems in Graph Theory

IEEE Transactions on Computers
On maximum clique problems in very large graphs

External memory algorithms
Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks

Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Approximating maximum clique with a Hopfield network

IEEE Transactions on Neural Networks

A general method of mining Chinese web documents based on GA&SA and position-factors

PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

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.