Partial-monotone adaptive submodular maximization
From MaRDI portal
Publication:2111204
DOI10.1007/S10878-022-00965-9OpenAlexW4312044990MaRDI QIDQ2111204FDOQ2111204
Publication date: 28 December 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.12840
Recommendations
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- The adaptive complexity of maximizing a submodular function
- Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Price of dependence: stochastic submodular maximization with dependent items
- Influence maximization with partial feedback
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
- Robust Adaptive Submodular Maximization
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- Partial-monotone adaptive submodular maximization
Cited In (4)
This page was built for publication: Partial-monotone adaptive submodular maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111204)