A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

Simons Institute via YouTube Direct link

A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

1 of 1

1 of 1

A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

Automatically move to the next video in the Classroom when playback concludes

  1. 1 A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.