### Table 1 Approximation algorithms for the Vertex Cover Problem

2006

"... In PAGE 3: ... Several approximation algorithms have been proposed for the Unweighted and Weighted Versions of the Vertex Cover Problem. We list some of them in Table1 . We decided to implement these algorithms because of their simplicity and performance guarantees.... ..."

### Table 2. Vertex-cover problem

2004

"... In PAGE 5: ...The results for the vertex-cover problem ( Table2 ) also demonstrate the effectiveness of bootstrapping. Within the prespecified number of tries per instance set at 600, WSAT(cc)+Boot finds solutions for all the instances while WSAT(cc) only for 82% of them.... ..."

Cited by 2

### Table 4: results for the weighted vertex cover problem

### Table 3: Extract of results from averaged TransKernelized Vertex Cover ACO (A) data, CycleKernelized Vertex Cover ACO (B) data, PreKernelized Vertex Cover ACO (C) data, and traditional Vertex Cover ACO (D) data. Times measured in seconds.

"... In PAGE 8: ... The Solution column gives the number of nodes in the vertex cover that the algorithm has chosen as op- timal; the Time column gives the number of seconds to flrst flnd a solution of this size. Table3 presents summarised data for all four algorithms, that is, the three new ACO algorithms plus the standard ACO algorithm. The columns labelled (A) are the results for TransKernelized Vertex Cover ACO.... ..."

### Table 2: Word classes and lexicon to encode vertex cover problem

1997

Cited by 31

### Table 2: Word classes and lexicon to encode vertex cover problem

1997

Cited by 31