Maximizing submodular set functions subject to multiple linear constraints
From MaRDI portal
Publication:4633865
Recommendations
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Efficient Submodular Function Maximization under Linear Packing Constraints
- Non-monotone submodular maximization under matroid and knapsack constraints
- scientific article; zbMATH DE number 5670654
- Constrained submodular maximization via greedy local search
Cited in
(42)- Algorithms for influence maximization in socio-physical networks
- scientific article; zbMATH DE number 5670654 (Why is no real title available?)
- Limitations of randomized mechanisms for combinatorial auctions
- Discrete optimization methods for group model selection in compressed sensing
- Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
- Submodular function minimization under a submodular set covering constraint
- Fractional 0-1 programming and submodularity
- An accelerated continuous greedy algorithm for maximizing strong submodular functions
- Optimization with demand oracles
- Time-sharing scheduling with tolerance capacities
- Pareto optimization for subset selection with dynamic cost constraints
- Submodular optimization problems and greedy strategies: a survey
- Streaming submodular maximization under \(d\)-knapsack constraints
- Generalized budgeted submodular set function maximization
- Strategyproof mechanisms for competitive influence in networks
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- Maximization of nonsubmodular functions under multiple constraints with applications
- Measured continuous greedy with differential privacy
- Efficient Submodular Function Maximization under Linear Packing Constraints
- Improved deterministic algorithms for non-monotone submodular maximization
- Non-monotone submodular function maximization under \(k\)-system constraint
- scientific article; zbMATH DE number 7650099 (Why is no real title available?)
- A note on the implications of approximate submodularity in discrete optimization
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- A note on submodular function minimization with covering type linear constraints
- Multi-pass streaming algorithms for monotone submodular function maximization
- Submodular Maximization Through the Lens of Linear Programming
- Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
- Algorithms for covering multiple submodular constraints and applications
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives
- Improved deterministic algorithms for non-monotone submodular maximization
- Multi-level facility location as the maximization of a submodular set function
- Submodular functions: learnability, structure, and optimization
- Bulk-robust combinatorial optimization
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- Submodularity and randomized rounding techniques for optimal experimental design
- Maximizing a class of submodular utility functions with constraints
This page was built for publication: Maximizing submodular set functions subject to multiple linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633865)
