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 Theoretical Computer Science
Peking University via edX Introducción a la Teoría Combinatoria
Universidad Católica de Murcia via Miríadax 离散数学概论 Discrete Mathematics Generality
Peking University via Coursera Discrete Mathematics
Indian Institute of Technology, Ropar via Swayam Discrete Mathematics
Shanghai Jiao Tong University via Coursera