Lecture 4: Greedy algorithms: Interval scheduling, Huffman codes and data compression (1)

About this video

Editorial review · 85% confidence

Round-9 hunt: picked; channel-level screens (sellers/exam/re-upload/devotional/vendor) passed; strict per-title check + final strict pass; oEmbed verified.

A 50-minute video from Center on Frontiers of Computing Studies, PKU: “Lecture 4: Greedy algorithms: Interval scheduling, Huffman codes and data compression (1)”.

Video by Center on Frontiers of Computing Studies, PKU, played through YouTube's embedded player.