If I'm covering the interval [0,1] with sets which are themselves closed intervals, is there a covering where the greedy algorithm does not find the optimal solution?
If the sets are not individual closed intervals (assume there are not open intervals) I can construct an example by letting one of the sets be two disconnected intervals; but I'm looking for an easier example for a presentation to a non-mathematical audience.