Generalized budgeted submodular set function maximization
From MaRDI portal
Recommendations
- Generalized budgeted submodular set function maximization
- The budgeted maximum coverage problem
- Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Fast algorithms for maximizing submodular functions
Cites work
- A 6/5-approximation algorithm for the maximum 3-cover problem
- A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems
- A note on maximizing a submodular set function subject to a knapsack constraint
- A threshold of ln n for approximating set cover
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- An analysis of approximations for maximizing submodular set functions—I
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 6851883 (Why is no real title available?)
- scientific article; zbMATH DE number 7204409 (Why is no real title available?)
- Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing Non-monotone Submodular Functions
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Monotone submodular maximization over a matroid via non-oblivious local search
- Recommending links through influence maximization
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular maximization over multiple matroids via generalized exchange properties
- The budgeted maximum coverage problem
- The generalized maximum coverage problem
- Wavelength management in WDM rings to maximize the number of connections
Cited in
(9)- The budgeted maximum coverage problem
- Robust budget allocation via continuous submodular functions
- Generalized budgeted submodular set function maximization
- Approximations for restrictions of the budgeted and generalized maximum coverage problems
- Ranking with submodular functions on a budget
- The multi-budget maximum weighted coverage problem
- Practical budgeted submodular maximization
- Improved greedy algorithm for maximum coverage problem with group budget constraints
- Pervasive domination
This page was built for publication: Generalized budgeted submodular set function maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005131)
