Given n segments of line (into the $X$ axis) with coordinates $[li; ri]$. You are to choose the minimum number of segments that cover the segment $[0;M]$. All segment are within $[0,M]$.
line segment covering problem
4
$\begingroup$
algorithms
-
0Same question at stackoverflow: http://stackoverflow.com/questions/3908139/need-effective-greedy-for-covering-a-line-segment – 2010-10-11