Example GREEDY-2 Run.

Each column represents the algorithm choosing a vertex to add to the set; vertices , , and were chosen and in that order. Vertices only appear if they are the maximum addition when considered or if they are ignored (represented by the inequalities). The format is as follows: the vertex considered appears first, followed by a parenthesis, and then either a value or an inequality. The inequality represents that the considered node had a lower addition to the of the set last iteration than the current best addition now, and therefore does not need to be computed this round. A single value represents the addition to that vertex would contribute.