vi riporto parte del testo (un articolo di bioinformatica):

In this section, we compute the approximation factor of the greedy version of the DSR Scheme. Let the number of new recombination events produced by the DSR algorithm in G3 be NDSR.

Using a simple greedy optimization approach, we include a third rule.

We show that the greedy polynomial time DSR based algorithm guarantees that the number of computed new recombination events is within