xukai-admin-GreedyAlgorithms(Chap.16).pptVIP

Greedy Algorithms Chap. 16 Optimization problems Dynamic programming, but overkill sometime. Greedy algorithm: Being greedy for local optimization with the hope it will lead to a global optimal solution, not always, but in many situations, it works. An Activity-Selection Problem Suppose A set of activities S a1, a2,…, an They use resources, such as lecture hall, one lecture at a time Each ai, has a start time si, and finish time fi, with 0? si fi ?. ai and aj are compatible if [si, fi and [sj, fj do not overlap Goal: select maximum-size subset of mutually compatible activities. Start f