An Ant-Based Algorithm for the Minimum Vertex Cover Problem
An Ant-Based Algorithm for the Minimum Vertex Cover Problem
An Ant-Based Algorithm for the Minimum Vertex Cover Problem
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
List of Figures2.1 A graph of Papadimitriou and Steiglitz with k = 3. . . . . . . . . . 42.2 A 2-Approximation <strong>Algorithm</strong> <strong>for</strong> <strong>the</strong> MVC <strong>Problem</strong>. . . . . . . . 53.1 <strong>An</strong> Overview of <strong>the</strong> AB–MVC <strong>Algorithm</strong>. . . . . . . . . . . . . . . 123.2 Cascading Effect of <strong>the</strong> Preprocessing Step Solves <strong>the</strong> Graph . . . 133.3 Movement of an <strong>An</strong>t <strong>Based</strong> on <strong>the</strong> Value of Movement Factor. . . . 143.4 One Step in <strong>the</strong> <strong>An</strong>t Movement <strong>Algorithm</strong>. . . . . . . . . . . . . . 163.5 Construction Stage. . . . . . . . . . . . . . . . . . . . . . . . . . . 183.6 Overview of Local Optimization Stage. . . . . . . . . . . . . . . . . 193.7 Rebuild <strong>Vertex</strong> <strong>Cover</strong> Technique. . . . . . . . . . . . . . . . . . . . 203.8 Redundant <strong>Vertex</strong> Removal Technique. . . . . . . . . . . . . . . . 224.1 Solution Quality Comparison. . . . . . . . . . . . . . . . . . . . . . 244.2 Running Time Comparison. . . . . . . . . . . . . . . . . . . . . . . 254.3 Solution Quality Comparison. . . . . . . . . . . . . . . . . . . . . . 26vi
Change language