Kernelization as heuristic structure for the vertex cover problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4150 LNCS, Issue , 2006, Pages 452-459

  Gilmour, Stephen ^a   Dras, Mark ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; METADATA; PROBLEM SOLVING;

ANT COLONY SYSTEM METAHEURISTIC; COMBINATORIAL OPTIMIZATION PROBLEMS; HEURISTIC STRUCTURE; KERNELIZATION;

DATA STRUCTURES;

EID: 33751368164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11839088_45     Document Type: Conference Paper

References (12)

1. Blum, C.: Ant colony optimization: Introduction and recent trends. Physics of Life Reviews 2 (2005) 353-373
2. Downey, R., Fellows, M., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1997)
3. Downey, R., Fellows, M.: Parameterized Complexity. Monographs in Computer Science. Springer-Verlag (1998)
4. Gilmour, S., Dras, M.: Understanding the Pheromone System within Ant Colony Optimization. Australian Conference on Artificial Intelligence (2005) 786-789
5. Dorigo, M., Stützle, T.: Ant Colony Optimization. A Bradford Book. MIT Press (2004)
6. Shyu, S.J., Yin, P.Y., Lin, B.M.T.: An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem. Annals of Operational Research 131 (2004) 283-304
7. Chen, J., Kanj, I., Jia, W.: Vertex cover: Further observations and further improvements. Journal of Algorithms 41 (2001) 280-301
8. Gilmour, S., Dras, M.: Exactness as Heuristic Structure for Guiding Ant Colony System. Technical report, Department of Computing, Macquarie University, Australia (2006)
9. Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: A simple model to generate hard satisfiable instances. Proceedings of 19th International Joint Conference on Artificial Intelligence (IJCAI). (2005) 337-342
10. Birattari, M.: On the Estimation of the Expected Performance of a Metaheuristic on a Class of Instances: How many instances, how many runs? IRIDIA Technical Report No. TR/IRIDIA/2004-001 (2005)
11. Taillard, E.D.: Comparison of non-deterministic iterative methods. MIC'2001 4th Metaheuristic International Conference (2001) 272-276
12. Skiena, S.S.: The algorithm design manual. Springer-Verlag New York, Inc., New York, NY, USA (1998)