Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint
From MaRDI portal
Publication:6201343
Cites work
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- A note on maximizing a submodular set function subject to a knapsack constraint
- An R-square coefficient based on final prediction error
- An analysis of approximations for maximizing submodular set functions—I
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Bicriteria algorithms to balance coverage and cost in team formation under online model
- Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents
- Maximizing Non-monotone Submodular Functions
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- Non-monotone submodular maximization under matroid and knapsack constraints
- Some optimal inapproximability results
- Submodularity in Input Node Selection for Networked Linear Systems: Efficient Algorithms for Performance and Controllability
- The budgeted maximum coverage problem
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
Cited in
(3)
This page was built for publication: Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201343)
