On multiplicative weight updates for concave and submodular function maximization
From MaRDI portal
Publication:2989031
DOI10.1145/2688073.2688086zbMATH Open1365.90225OpenAlexW2035442052MaRDI QIDQ2989031FDOQ2989031
Authors: Chandra Chekuri, T. S. Jayram, Jan Vondrák 
Publication date: 19 May 2017
Published in: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2688073.2688086
Recommendations
- Fast algorithms for maximizing submodular functions
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- scientific article; zbMATH DE number 7255156
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular function maximization in parallel via the multilinear relaxation
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (17)
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization
- Algorithms for covering multiple submodular constraints and applications
- Streaming Algorithms for Submodular Function Maximization
- Measured continuous greedy with differential privacy
- Online non-monotone diminishing return submodular maximization in the bandit setting
- Submodular Optimization with Contention Resolution Extensions.
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint
- Title not available (Why is that?)
- Stochastic Variance Reduction for DR-Submodular Maximization
- Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint
- Title not available (Why is that?)
- Private non-monotone submodular maximization
This page was built for publication: On multiplicative weight updates for concave and submodular function maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989031)
