Consider a modification to the activity-selection problem in which each activity a i has, in addition to
Question:
Consider a modification to the activity-selection problem in which each activity ai has, in addition to a start and finish time, a value νi. The objective is no longer to maximize the number of activities scheduled, but instead to maximize the total value of the activities scheduled. That is, we wish to choose a set A of compatible activities such that ∑aki∈A νk is maximized. Give a polynomial-time algorithm for this problem.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Question Posted: