= Lecture 1: Introduction
{c}
Unsigned lecture notes issued by Massachusetts Institute of Technology and hosted by MIT OpenCourseWare. No individual author byline or PDF publication or revision date is established.
Lecture notes: https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2015/ff2a7015ff913fc01f0381d8f5126a9a_MIT6_046JS15_lec01.pdf
Cited passages: printed p. 2, Interval Scheduling and non-strict compatibility inequalities; printed pp. 3–4, Claim 2 and induction; printed pp. 4–5, Weighted Interval Scheduling and Dynamic Programming; PDF p. 6, institutional course footer.
Back to article page
