Submodular maximization by simulated annealing
From MaRDI portal
Recommendations
- Maximizing Non-monotone Submodular Functions
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Fast algorithms for maximizing submodular functions
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Maximizing a monotone submodular function subject to a matroid constraint
Cited in
(53)- Explaining anomalies in groups with characterizing subspace rules
- Robust monotone submodular function maximization
- Non-monotone submodular function maximization under k-system constraint
- Private non-monotone submodular maximization
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- Measured continuous greedy with differential privacy
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- Optimization with demand oracles
- Limitations of randomized mechanisms for combinatorial auctions
- Profit maximization in social networks and non-monotone DR-submodular maximization
- Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
- Distributed submodular maximization
- Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Submodular Max-SAT
- 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
- Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
- Submodular functions: learnability, structure, and optimization
- The submodular secretary problem goes linear
- Simultaneous approximation of multi-criteria submodular function maximization
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- Online submodular maximization with preemption
- The power of subsampling in submodular maximization
- Constrained submodular maximization via a nonsymmetric technique
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- Submodular functions are noise stable
- Sequence submodular maximization meets streaming
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
- A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity
- On maximizing sums of non-monotone submodular and linear functions
- Improved deterministic algorithms for non-monotone submodular maximization
- A binary search double greedy algorithm for non-monotone DR-submodular maximization
- Improved deterministic algorithms for non-monotone submodular maximization
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid
- Regularized nonmonotone submodular maximization
- Data summarization beyond monotonicity: non-monotone two-stage submodular maximization
- Two-stage submodular maximization problem beyond nonnegative and monotone
- Monotone submodular maximization under the pairwise capacity constraint
- Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint
- Group equality and equity in submodular maximization
- Deletion robust non-monotone submodular maximization over matroids
- Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
- 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
- Time lower bounds for the Metropolis process and simulated annealing
This page was built for publication: Submodular maximization by simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365102)
