On Multiplicative Weight Updates for Concave and Submodular Function Maximization
From MaRDI portal
Publication:2989031
DOI10.1145/2688073.2688086zbMath1365.90225OpenAlexW2035442052MaRDI QIDQ2989031
T. S. Jayram, Jan Vondrák, Chandra Chekuri
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Streaming Algorithms for Submodular Function Maximization ⋮ An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model ⋮ Measured continuous greedy with differential privacy ⋮ Algorithms for covering multiple submodular constraints and applications ⋮ Unnamed Item ⋮ Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint ⋮ Stochastic block-coordinate gradient projection algorithms for submodular maximization ⋮ Submodular Optimization with Contention Resolution Extensions. ⋮ Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization ⋮ Unnamed Item ⋮ Parallelized maximization of nonsubmodular function subject to a cardinality constraint ⋮ Parallelized maximization of nonsubmodular function subject to a cardinality constraint ⋮ Private non-monotone submodular maximization ⋮ An adaptive algorithm for maximization of non-submodular function with a matroid constraint ⋮ Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint
