A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore a cutting-edge algorithm for submodular maximization with knapsack constraints in this 33-minute lecture by Alina Ene from Boston University. Delve into the world of discrete optimization via continuous relaxation as part of the Simons Institute's series on advanced algorithmic techniques. Learn about the nearly-linear time complexity of this innovative approach and its potential applications in solving complex optimization problems efficiently.
Syllabus
A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Taught by
Simons Institute
Related Courses
Introduction to Computational Thinking and Data ScienceMassachusetts Institute of Technology via edX Approximation Algorithms Part I
École normale supérieure via Coursera Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Stanford University via Coursera Recursion, Backtracking and Dynamic Programming in Python
Udemy Dynamic Programming
YouTube