A Unified Continuous Greedy Algorithm for Submodular Maximization
From MaRDI portal
Cited in
(92)- Approximating graph-constrained max-cut
- Robust monotone submodular function maximization
- Non-monotone submodular function maximization under k-system constraint
- Harnessing the power of deception in attack graph-based security games
- An almost optimal approximation algorithm for monotone submodular multiple knapsack
- Nonsubmodular constrained profit maximization from increment perspective
- Private non-monotone submodular maximization
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- Multi-attribute based influence maximization in social networks: algorithms and analysis
- 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
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
- Viral marketing of online game by DS decomposition in social networks
- Approximating max-cut under graph-MSO constraints
- Constrained submodular maximization via greedy local search
- Set function optimization
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- Bulk-robust combinatorial optimization
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice
- Group fairness in non-monotone submodular maximization
- On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints
- Max-cut under graph constraints
- Robust monotone submodular function maximization
- Submodular stochastic probing on matroids
- 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
- Submodular functions: learnability, structure, and optimization
- The submodular secretary problem goes linear
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- scientific article; zbMATH DE number 7255156 (Why is no real title available?)
- Online submodular maximization with preemption
- Multi-agent submodular optimization
- Generalized assignment via submodular optimization with reserved capacity
- Structured Robust Submodular Maximization: Offline and Online Algorithms
- Prophet matching with general arrivals
- The power of subsampling in submodular maximization
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- Constrained submodular maximization via a nonsymmetric technique
- Submodular Maximization Through the Lens of Linear Programming
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- Submodular maximization with uncertain knapsack capacity
- Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints
- 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
- Submodular Optimization with Contention Resolution Extensions.
- Sequence submodular maximization meets streaming
- \(\ell_1\)-sparsity approximation bounds for packing integer programs
- Novel algorithms for maximum DS decomposition
- Guess free maximization of submodular and linear sums
- A bi-criteria algorithm for online non-monotone maximization problems: DR-submodular+concave
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
- scientific article; zbMATH DE number 7765403 (Why is no real title available?)
- Two-stage submodular maximization under knapsack and matroid constraints
- The Frank-Wolfe algorithm: a short introduction
- On maximizing sums of non-monotone submodular and linear functions
- Improved deterministic algorithms for non-monotone submodular maximization
- Unified Greedy Approximability beyond Submodular Maximization
- Unified greedy approximability beyond submodular maximization
- A stochastic non-monotone DR-submodular maximization problem over a convex set
- Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret
- Improved deterministic algorithms for non-monotone submodular maximization
- Stochastic Variance Reduction for DR-Submodular Maximization
- Regularized nonmonotone submodular maximization
- DR-submodular function maximization with adaptive stepsize
- The regularized submodular maximization via the Lyapunov method
- Two-stage submodular maximization problem beyond nonnegative and monotone
- Maximizing stochastic set function under a matroid constraint from decomposition
- On submodular prophet inequalities and correlation gap
- Optimal streaming algorithms for submodular maximization with cardinality constraints
- Separating coverage and submodular: maximization subject to a cardinality constraint
- Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity
- Pandora's box problem with time constraints
- Dynamic algorithms for non-monotone submodular maximization
- Global approximation of local optimality: nonsubmodular optimization
- Deletion robust non-monotone submodular maximization over matroids
- Approximating continuous multi-agent contracts with Lyapunov function methods
- Properties and algorithm of lattice pseudo-submodular functions
- Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
- Correlated stochastic knapsack with a submodular objective
- Maximizing sums of non-monotone submodular and linear functions: understanding the unconstrained case
- Efficient deterministic algorithms for maximizing symmetric submodular functions
- Greedy algorithms for stochastic monotone k-submodular maximization under full-bandit feedback
- Enhanced deterministic approximation algorithm for non-monotone submodular maximization under knapsack constraint with linear query complexity
- Blocking rumor by cut
- Budget and profit approximations for spanning tree interdiction
- Fast algorithms for monotone submodular meta-learning under the cardinality constraint
This page was built for publication: A Unified Continuous Greedy Algorithm for Submodular Maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495032)
