A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
About this video
Advanced · Editorial review · 85% confidenceSimons Institute for the Theory of Computing is already on Lumen; this upload was never considered before. Channel treated as academic (strict check, default pass); title passed a strict per-title check; oEmbed verified.
A 33-minute video from Simons Institute for the Theory of Computing: “A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint”.
Video by Simons Institute for the Theory of Computing, played through YouTube's embedded player.