2 Standard 3 - Exchange arguments 2.1 Problem I Problem 1. Consider the Interval Scheduling problem that takes as input
Posted: Mon May 09, 2022 5:56 am
2 Standard 3 - Exchange arguments 2.1 Problem I Problem 1. Consider the Interval Scheduling problem that takes as input a set of intervals I. Each interval i el has a start value i.start and an end value i.end and returns a set of non-overlapping intervals of maximal size. Prove that the greedy choice of selecting the interval that ends first will yield an optimal solution. Answer.