Algorithm Design and Analysis

Frage	Antworten
Dynamic Programming	Decompossing Things To SubProblems
Weighted Interval Scheduling	Recursive, Each Interval has Certain Weight We want set of max w
Original Interval Scheduling Problem is simply the special case in which all values are equal to 1,	Image: Weight_Interval_Schedule.PNG (image/PNG)
n requests labeled 1,2,3,...,n Request i specify start time Si, finish t fi i also has value weight	Image: valuewight.PNG (image/PNG)
i is the leftmost interval that ends before j begins. We define p(j) = 0 if no request i < j is disjoint from j	Image: wieghtInterval2.PNG (image/PNG)

Zusammenfassung der Ressource

	Erstellt von yoy1992 vor mehr als 12 Jahre