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)- Maximization of submodular functions: theory and enumeration algorithms
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- An approximation algorithm for a competitive facility location problem with network effects
- Robust monotone submodular function maximization
- Non-monotone submodular function maximization under k-system constraint
- Generalized budgeted submodular set function maximization
- Private non-monotone submodular maximization
- 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
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- New approximations and hardness results for submodular partitioning problems
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- Streaming submodular maximization under differential privacy noise
- Measured continuous greedy with differential privacy
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- Information coverage maximization for multiple products in social networks
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
- Viral marketing of online game by DS decomposition in social networks
- Profit maximization problem with coupons in social networks
- Set function optimization
- Computing a small agreeable set of indivisible items
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
- Informative path planning as a maximum traveling salesman problem with submodular rewards
- A tight analysis of the submodular-supermodular procedure
- Oblivious algorithms for the maximum directed cut problem
- Submodular functions: from discrete to continuous domains
- Inequalities on submodular functions via term rewriting
- On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function
- On additive approximate submodularity
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice
- Submodular maximization over data streams with differential privacy noise
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- Profit maximization in social networks and non-monotone DR-submodular maximization
- Optimal bounds on approximation of submodular and XOS functions by juntas
- Symmetry and approximability of submodular maximization problems
- Techniques for submodular maximization
- Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
- Hardness of submodular cost allocation: lattice matching and a simplex coloring conjecture
- Algorithms and lower bounds for submodular cuts and approximating submodular functions
- Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Submodular Max-SAT
- The Expressive Power of Binary Submodular Functions
- Robust monotone submodular function maximization
- A survey on double greedy algorithms for maximizing non-monotone submodular functions
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Improved inapproximability for submodular maximization
- An approximation algorithm and its performance guarantee for maximizing non-increasing submodular set function
- An FPTAS for optimizing a class of low-rank functions over a polytope
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- On complexity of maximizatin of submodular functions*
- Submodular functions: learnability, structure, and optimization
- Online submodular welfare maximization: greedy beats 1/2 in random order
- Deterministic algorithms for submodular maximization problems
- The submodular secretary problem goes linear
- Testing submodularity and other properties of valuation functions
- Is submodularity testable?
- Simultaneous approximation of multi-criteria submodular function maximization
- A framework of discrete DC programming by discrete convex analysis
- Faster and simpler sketches of valuation functions
- 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
- Projection-free decentralized online learning for submodular maximization over time-varying networks
- Generalized budgeted submodular set function maximization
- Multi-agent submodular optimization
- \(k\)-submodular maximization with two kinds of constraints
- Tight approximation for unconstrained XOS maximization
- Fast Distributed Approximation for Max-Cut
- Submodular secretary problem with shortlists
- 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
- Stability and recovery for independence systems
- Maximizing a class of submodular utility functions with constraints
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- Finding submodularity hidden in symmetric difference
- New performance guarantees for the greedy maximization of submodular set functions
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- Optimization with uniform size queries
- Submodular maximization by simulated annealing
- Submodular maximization with cardinality constraints
- Maximizing bisubmodular and \(k\)-submodular functions
- From query complexity to computational complexity
- Submodular functions are noise stable
- Improved randomized algorithm for k-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
- Submodular Optimization with Contention Resolution Extensions.
- Sequence submodular maximization meets streaming
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Posimodular function optimization
- Fast algorithms for maximizing monotone nonsubmodular functions
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)
