Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
From MaRDI portal
Publication:5094029
Recommendations
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
- Non-monotone submodular maximization under matroid and knapsack constraints
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 5485514 (Why is no real title available?)
- scientific article; zbMATH DE number 3580314 (Why is no real title available?)
- scientific article; zbMATH DE number 7650116 (Why is no real title available?)
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- A note on maximizing a submodular set function subject to a knapsack constraint
- A threshold of ln n for approximating set cover
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Adaptivity gaps for stochastic probing: submodular and XOS functions
- An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation
- An analysis of approximations for maximizing submodular set functions—I
- Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
- Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
- Matroids and the greedy algorithm
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Maximizing Non-monotone Submodular Functions
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- On multiplicative weight updates for concave and submodular function maximization
- On the approximability of budget feasible mechanisms
- Some properties of batch value of information in the selection problem
- Streaming algorithms for submodular function maximization
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular maximization with cardinality constraints
- Submodular maximization with matroid and packing constraints in parallel
- Submodular maximization with nearly optimal approximation, adaptivity and query complexity
- The adaptive complexity of maximizing a submodular function
- The budgeted maximum coverage problem
- The submodular secretary problem goes linear
Cited in
(6)- Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
- Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
- Improved deterministic algorithms for non-monotone submodular maximization
- Partial-monotone adaptive submodular maximization
- Partial-adaptive submodular maximization
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
This page was built for publication: Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094029)
