Solution Found!
Show that a greedy algorithm that schedules talks in a
Chapter 2, Problem 58E(choose chapter or problem)
QUESTION:
Show that a greedy algorithm that schedules talks in a lecture hall, as described in Example 7. by selecting at each step the talk that overlaps the fewest other talks, does not always produce an optimal schedule.
Questions & Answers
QUESTION:
Show that a greedy algorithm that schedules talks in a lecture hall, as described in Example 7. by selecting at each step the talk that overlaps the fewest other talks, does not always produce an optimal schedule.
ANSWER:Solution :Step 1:In this problem, we have to show that the greedy algorithm that schedules talks in a lecture hall, if selecting at each step the talk that overlaps the fewest other talks, does not always produce an optimal schedule.