'Goal minimize maximum lateness' presentation slideshows

Lecture 20

256 views • 25 slides

Lecture 19

Lecture 19. CSE 331 Oct 10, 2016. Quiz starts at 1pm and ends at 1:10pm. In 1(b), IGNORE time taken to initialize data structures. Lecture starts at 1:15pm. Pitch grading half done. Please wait for grading rubric before asking grading questions. Interval Scheduling Problem.

193 views • 18 slides

Lecture 19

Lecture 19. CSE 331 Oct 12, 2016. Mid-term-I Monday. In class. 1:00pm-1:50pm sharp. Eight True/False with justification Qs. Questions?. Analyzing the algorithm. R : set of requests. A* has no conflicts. Set A to be the empty set. While R is not empty.

137 views • 13 slides

Lecture 20

Lecture 20. CSE 331 Oct 21, 2009. Algorithm for Interval Scheduling. R : set of requests. Set A to be the empty set. While R is not empty. Choose i in R with the earliest finish time. Add i to A. Remove all requests that conflict with i from R. A is optimal. Return A.

206 views • 12 slides