The algorithm for solving vertex cover that achieves the best asymptotic dependence on the parameter runs in time formula_25. The klam value of this time bound (an estimate for the largest parameter value that could be solved in a reasonable amount of time) is approximately 190. That is, unless additional algorithmic improvements can be found, this algorithm is suitable only for instances whose vertex cover number is 190 or less. Under reasonable complexity-theoretic assumptions, namely the exponential time hypothesis, the running time cannot be improved to 2"o"("k"), even when formula_26 is formula_27.