What is a good algorithm for getting the minimum vertex cover of a tree?

Question

What is a good algorithm for getting the minimum vertex cover of a tree?

INPUT:

The node\'s neighbours.

OUTPUT:

The minimum number of vertice

Answer 1

I would simply use a linear program to solve the minimum vertex cover problem. A formulation as an integer linear program could look like the one given here: ILP formulation

I don't think that your own implementation would be faster than these highly optimized LP solvers.