 If any one of the following three conditions is satisfied, then there is a conceptually simple deterministic greedy algorithm whose competitive ratio is 1-\frac{1{e}.
<coherence>  If any one of the following three conditions is satisfied, then there is a conceptually simple deterministic greedy algorithm whose competitive ratio is 1-\frac{1{e}.
 {e}.