Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint
From MaRDI portal
Publication:5024901
DOI10.1142/S0217595921400091OpenAlexW3135659653MaRDI QIDQ5024901FDOQ5024901
Authors: Jingjing Tan, Wen-Ting Chen, Meixia Li, Wenchao Wang 
Publication date: 1 February 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595921400091
Cites Work
- A threshold of ln n for approximating set cover
- Maximizing a monotone submodular function subject to a matroid constraint
- An analysis of approximations for maximizing submodular set functions—I
- Title not available (Why is that?)
- Optimal approximation for the submodular welfare problem in the value oracle model
- Title not available (Why is that?)
- Submodularity and randomized rounding techniques for optimal experimental design
- On multiplicative weight updates for concave and submodular function maximization
- Parametric monotone function maximization with matroid constraints
- Non-submodular maximization on massive data streams
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
- The adaptive complexity of maximizing a submodular function
- Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
- Submodular function maximization in parallel via the multilinear relaxation
- Approximating robust parameterized submodular function maximization in large-scales
Cited In (1)
This page was built for publication: Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024901)
