Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers

Discrete Optimization

Volumn 6, Issue 2, 2009, Pages 214-219

  Pullan, Wayne ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

Local search; Maximum weighted independent set; Minimum weighted vertex cover

Indexed keywords

LEARNING ALGORITHMS; WIRELESS TELECOMMUNICATION SYSTEMS;

ITERATIVE IMPROVEMENTS; LOCAL SEARCH; LOCAL SEARCH ALGORITHMS; MAXIMUM CLIQUES; MAXIMUM INDEPENDENT SETS; MAXIMUM WEIGHTED INDEPENDENT SET; MINIMUM VERTEX COVERS; MINIMUM WEIGHTED VERTEX COVER; OPTIMISATION; PROBLEM INSTANCES; STATE-OF-THE-ART PERFORMANCE; VERTEX SELECTIONS;

ALGORITHMS;

EID: 59849086880     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2008.12.001     Document Type: Article

References (8)

1. Bomze I., Budinich M., Pardalos P., and Pelillo M. The maximum clique problem. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization vol. A. (1999) 1-74
2. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of N P-Completeness (1979), Freeman, San Francisco, CA, USA
3. In: Johnson D., and Trick M. (Eds). Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series vol. 26 (1996), American Mathematical Society
4. Gibbons L., Hearn D., and Pardalos P. A continuous based heuristic for the maximum clique problem. In: Johnson D.S., and ~ M.T. (Eds). Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series vol. 26 (1996), American Mathematical Society
5. Aggarwal C., Orlin J., and Tai R. Optimised crossover for the independent set problem. Operations Research 45 (1997) 226-234
6. Busygin S., Butenko S., and Pardalos P. A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere. Journal of Combinatorial Optimization 6 (2002) 287-297
7. Barbosa V., and Campos L. A novel evolutionary formulation of the maximum independent set problem. Journal of Combinatorial Optimization 8 (2004) 419-437
8. Pullan W. Phased local search for the maximum clique problem. Journal of Combinatorial Optimization 12 (2006) 303-323