Maximizing Non-monotone Submodular Functions
From MaRDI portal
Recommendations
- Maximization of constrained non-submodular functions
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Maximizing a class of submodular utility functions
- Maximize a monotone function with a generic submodularity ratio
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- Maximizing a monotone non-submodular function under a knapsack constraint
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Non-monotone submodular function maximization under k-system constraint
- Maximizing k-submodular functions and beyond
Cited in
(only showing first 100 items - show all)- A framework of discrete DC programming by discrete convex analysis
- Faster and simpler sketches of valuation functions
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
- A tight analysis of the submodular-supermodular procedure
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- Stability and recovery for independence systems
- Submodular Maximization Through the Lens of Linear Programming
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- Dynamic algorithms for non-monotone submodular maximization
- Projection-free decentralized online learning for submodular maximization over time-varying networks
- From worst case to the average: structural guarantees in k-CSP approximation via orthogonal arrays
- Fast algorithms for maximizing monotone nonsubmodular functions
- Maximizing a class of submodular utility functions with constraints
- Optimal bounds on approximation of submodular and XOS functions by juntas
- An FPTAS for optimizing a class of low-rank functions over a polytope
- Classes of submodular constraints expressible by graph cuts
- Submodular functions are noise stable
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- Online submodular maximization with preemption
- A survey on double greedy algorithms for maximizing non-monotone submodular functions
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
- A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- Private non-monotone submodular maximization
- Regularized nonmonotone submodular maximization
- Tight approximation for unconstrained XOS maximization
- The one-way communication complexity of submodular maximization with applications to streaming and robustness
- Computing a small agreeable set of indivisible items
- New performance guarantees for the greedy maximization of submodular set functions
- Submodular secretary problem with shortlists
- Optimization with uniform size queries
- Informative path planning as a maximum traveling salesman problem with submodular rewards
- From query complexity to computational complexity
- Deletion robust non-monotone submodular maximization over matroids
- Improved inapproximability for submodular maximization
- On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities
- On maximizing sums of non-monotone submodular and linear functions
- An approximation algorithm and its performance guarantee for maximizing non-increasing submodular set function
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Submodular function minimization and polarity
- scientific article; zbMATH DE number 7255156 (Why is no real title available?)
- Profit maximization in social networks and non-monotone DR-submodular maximization
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- New approximations and hardness results for submodular partitioning problems
- Submodular participatory budgeting
- Fast Distributed Approximation for Max-Cut
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- Maximizing sums of non-monotone submodular and linear functions: understanding the unconstrained case
- Hardness of submodular cost allocation: lattice matching and a simplex coloring conjecture
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- Efficient deterministic algorithms for maximizing symmetric submodular functions
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity
- Constrained submodular maximization via a nonsymmetric technique
- Multi-agent submodular optimization
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
- Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- Is submodularity testable?
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- The submodular secretary problem goes linear
- Viral marketing of online game by DS decomposition in social networks
- Submodular maximization with cardinality constraints
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Submodular functions: learnability, structure, and optimization
- Constraint generation approaches for submodular function maximization leveraging graph properties
- Robust monotone submodular function maximization
- An approximation algorithm for a competitive facility location problem with network effects
- Blocking rumor by cut
- Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise
- Practical parallel algorithms for non-monotone submodular maximization
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- Non-monotone submodular function maximization under k-system constraint
- The expressive power of binary submodular functions
- Improved randomized algorithm for k-submodular function maximization
- Online submodular welfare maximization: greedy beats 1/2 in random order
- Finding submodularity hidden in symmetric difference
- Information coverage maximization for multiple products in social networks
- Set function optimization
- Online contention resolution schemes with applications to Bayesian selection problems
- Submodular maximization by simulated annealing
- Algorithms and lower bounds for submodular cuts and approximating submodular functions
- Inequalities on submodular functions via term rewriting
- Improved linear-time streaming algorithms for maximizing monotone cardinality-constrained set functions
- Greedy algorithm for maximization of semi-monotone non-submodular functions with applications
- Symmetry and approximability of submodular maximization problems
- Submodular Max-SAT
- Streaming submodular maximization under differential privacy noise
- Measured continuous greedy with differential privacy
- Deterministic algorithms for submodular maximization problems
- Budget-feasible mechanism design for non-monotone submodular objectives: offline and online
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid
- Linearly representable submodular functions: an algebraic algorithm for minimization
- Optimal streaming algorithms for submodular maximization with cardinality constraints
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
This page was built for publication: Maximizing Non-monotone Submodular Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096096)
