Pages that link to "Item:Q2216441"
From MaRDI portal
The following pages link to Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time (Q2216441):
Displaying 12 items.
- Adaptive robust submodular optimization and beyond (Q2039658) (← links)
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints (Q2087465) (← links)
- Partial-monotone adaptive submodular maximization (Q2111204) (← links)
- Streaming adaptive submodular maximization (Q2680175) (← links)
- Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions (Q4575608) (← links)
- Robust Adaptive Submodular Maximization (Q5060800) (← links)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint (Q5094029) (← links)
- Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time (Q5236199) (← links)
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918747) (← links)
- Data summarization beyond monotonicity: non-monotone two-stage submodular maximization (Q6606190) (← links)
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints (Q6629012) (← links)