A tree T with n nodes, every node has zero or more children.

add k new more edges between the above nodes, k = O(log n).

design an algorithm to find the minimum vertex cover in the final undirect graph G.

G = T + k new more edges.

the time complexity should be polynomial of n.