A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles
About this video
Editorial review · 85% confidenceRound-10 hunt: picked; channel-level screens (sellers/exam/re-upload/devotional/vendor/events) and provenance check passed; strict per-title check + final strict pass; oEmbed verified.
A 56-minute video from Algorithms at University of Warsaw: “A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles”.
Video by Algorithms at University of Warsaw, played through YouTube's embedded player.