And this is amazing because now it means that not only the decision variant of vertex cover can be solved in (2.4^k' n³) time, but it means that the optimization variant of vertex cover can also be solved in O(2.4^k'n³ )time, where k is the minimum size of a vertex cover for the input graph. 