Motivation: getting around! In this lecture, we look at optimization problems such as: What about efficiency? Shortest route or fastest route (might not be the same!)?
Source: Erik Demaine, Mathematics for Computer Science (MIT: OpenCourseWare). Licensed under CC BY-NC-SA 4.0.
Hypha Learn
Free university lectures and educational content, curated and republished from public sources.
4
see also ↓
-
IAP 2018: How to Speak1:03:42 Free