We consider the expected performance of two greedy matching algorithms on sparse random graphs and also on random trees. In all cases we establish expressions for the mean and variance of the number ...

This paper describes a greedy heuristic for a class of combinatorial optimization problems; a central feature of the method being a look-ahead capability. The power of the heuristic is demonstrated ...