What is the problem if we sort the intervals according to their finishing time like the interval scheduling problem? Could someone give a counterexample ?
Note- (refer here for detailed definition)
Interval Partioning Problem: Multiple Identical Resources are available and we have to partition all intervals across these resources using as few as possible. On each resource all intervals should be non overlapping.
Interval Scheduling Problem: Only one resource is available. We have to maximise the number of non-overlapping intervals we can use on that single resource.
