Table 1.
Experimental results for instances with two binary trees
|
Exact algorithms |
CYCLEKILLER
|
||||||||
|---|---|---|---|---|---|---|---|---|---|
|
Dataset |
Total runs |
Completed |
Time |
2-approx |
4-approx |
Ratio |
Opt. found |
||
| Compl. | Time | Compl. | Time | ||||||
| Easy |
800 |
767 |
798 |
800 |
3 |
- |
- |
1.003 |
96.6% |
| Medium |
640 |
199 |
2572 |
613 |
212 |
27 |
<1 |
1.002 |
97.5% |
| Hard | 640 | 0 | 3600 | 440 | 1271 | 200 | 1.5 | - | - |
The third column indicates for how many instances at least one exact algorithm finished within one hour. The fifth column indicates for how many instances the 2-approx option of CYCLEKILLER finished within one hour. For the remaining instances, the 4-approx option finished within one hour, as can be seen from the seventh column. The average running time for the 2-approx and the 4-approx in seconds are reported respectively in the sixth and eighth column. The average approximation ratio (ninth column) is taken over all instances for which at least one exact method finished. The last column indicates the percentage of those instances for which CYCLEKILLER found an optimal solution.