A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
1,518 views · Published 13 September 2017 · 33:03 · Indexed 12 November 2026
Channel: Simons Institute for the Theory of Computing · 2017 · Education
Alina Ene, Boston University https://simons.berkeley.edu/talks/alina-ene-09-13-17 Discrete Optimization via Continuous Relaxation
More from this channel
-
35:16
Probabilistic Polynomials and Hamming Nearest Neighbors
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
34:31
Algorithmic Bayesian Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions