Submodular maximization with cardinality constraints
From MaRDI portal
Recommendations
- Fast algorithms for maximizing submodular functions
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Non-monotone submodular maximization under matroid and knapsack constraints
- Fast algorithms for maximizing monotone nonsubmodular functions
- Maximizing Non-monotone Submodular Functions
Cited in
(84)- Explaining anomalies in groups with characterizing subspace rules
- Online budgeted maximum coverage
- Non-monotone submodular function maximization under k-system constraint
- Adaptive robust submodular optimization and beyond
- An almost optimal approximation algorithm for monotone submodular multiple knapsack
- Private non-monotone submodular maximization
- A new greedy strategy for maximizing monotone submodular function under a cardinality constraint
- Measured continuous greedy with differential privacy
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- Submodular optimization problems and greedy strategies: a survey
- On the equivalence of optimal recommendation sets and myopically optimal query sets
- Influence maximization in the presence of vulnerable nodes: a ratio perspective
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
- I/O-efficient calculation of H-group closeness centrality over disk-resident graphs
- Constrained submodular maximization via greedy local search
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
- Minimizing ratio of monotone non-submodular functions
- Stochastic-lazier-greedy algorithm for monotone non-submodular maximization
- A mobile multi-agent sensing problem with submodular functions under a partition matroid
- Analyzing Residual Random Greedy for monotone submodular maximization
- Group fairness in non-monotone submodular maximization
- Practical budgeted submodular maximization
- Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint
- Randomized composable core-sets for distributed submodular maximization
- Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
- A survey on double greedy algorithms for maximizing non-monotone submodular functions
- Streaming algorithms for submodular function maximization
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Structured sparsity: discrete and convex approaches
- Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
- The submodular secretary problem goes linear
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- Online submodular maximization with preemption
- Robust Maximization of Correlated Submodular Functions Under Cardinality and Matroid Constraints
- Structured Robust Submodular Maximization: Offline and Online Algorithms
- The power of subsampling in submodular maximization
- Submodular secretary problem with shortlists
- Towards nearly-linear time algorithms for submodular maximization with a matroid constraint
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- Constrained submodular maximization via a nonsymmetric technique
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- Online contention resolution schemes with applications to Bayesian selection problems
- Budget-feasible mechanism design for non-monotone submodular objectives: offline and online
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem
- Sequence submodular maximization meets streaming
- Novel algorithms for maximum DS decomposition
- Guess free maximization of submodular and linear sums
- Semi-streaming algorithms for submodular matroid intersection
- Beyond submodularity: a unified framework of randomized set selection with group fairness constraints
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
- Improved deterministic algorithms for non-monotone submodular maximization
- Unified Greedy Approximability beyond Submodular Maximization
- Unified greedy approximability beyond submodular maximization
- Improved deterministic algorithms for non-monotone submodular maximization
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid
- Differentially private submodular maximization with a cardinality constraint over the integer lattice
- Regularized nonmonotone submodular maximization
- Multi-class imbalance problem: a multi-objective solution
- Optimal experimental design: formulations and computations
- Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models
- Data summarization beyond monotonicity: non-monotone two-stage submodular maximization
- \textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
- Semi-streaming algorithms for submodular function maximization under \(b\)-matching, matroid, and matchoid constraints
- On submodular prophet inequalities and correlation gap
- Randomized greedy methods for weak submodular sensor selection with robustness considerations
- Optimal streaming algorithms for submodular maximization with cardinality constraints
- Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint
- Subquadratic submodular maximization with a general matroid constraint
- Separating coverage and submodular: maximization subject to a cardinality constraint
- Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity
- Group equality and equity in submodular maximization
- Supermodular rank: set function decomposition and optimization
- Deletion robust non-monotone submodular maximization over matroids
- Properties and algorithm of lattice pseudo-submodular functions
- A differentially private approximation algorithm for submodular maximization under a polymatroid constraint over the integer lattice
- Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
- Efficient deterministic algorithms for maximizing symmetric submodular functions
- Practical parallel algorithms for non-monotone submodular maximization
- Submodular combinatorial information measures with applications in machine learning
- A semi-streaming algorithm for monotone regularized submodular maximization with a matroid constraint
- New results on a general class of minimum norm optimization problems
- Max-Cut with multiple cardinality constraints
This page was built for publication: Submodular maximization with cardinality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384068)
