Deterministic Algorithms for Submodular Maximization Problems
From MaRDI portal
Abstract: Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area most algorithms are randomized, and in almost all cases the approximation ratios obtained by current randomized algorithms are superior to the best results obtained by known deterministic algorithms. Derandomization of algorithms for general submodular function maximization seems hard since the access to the function is done via a value oracle. This makes it hard, for example, to apply standard derandomization techniques such as conditional expectations. Therefore, an interesting fundamental problem in this area is whether randomization is inherently necessary for obtaining good approximation ratios. In this work we give evidence that randomization is not necessary for obtaining good algorithms by presenting a new technique for derandomization of algorithms for submodular function maximization. Our high level idea is to maintain explicitly a (small) distribution over the states of the algorithm, and carefully update it using marginal values obtained from an extreme point solution of a suitable linear formulation. We demonstrate our technique on two recent algorithms for unconstrained submodular maximization and for maximizing submodular function subject to a cardinality constraint. In particular, for unconstrained submodular maximization we obtain an optimal deterministic -approximation showing that randomization is unnecessary for obtaining optimal results for this setting.
Recommendations
- Deterministic algorithms for submodular maximization problems
- Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
- Improved deterministic algorithms for non-monotone submodular maximization
- scientific article; zbMATH DE number 3922372
- Exact algorithms for combinatorial optimization problems with submodular objective functions
- Optimum algorithm for maximization of submodular functions
- Approximation guarantees for deterministic maximization of submodular function with a matroid constraint
- Maximization of submodular functions: theory and enumeration algorithms
- On complexity of maximizatin of submodular functions*
- Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
Cited in
(33)- Improved deterministic algorithms for non-monotone submodular maximization
- Profit maximization in social networks and non-monotone DR-submodular maximization
- Deterministic algorithms for the hidden subgroup problem
- Improved deterministic algorithms for non-monotone submodular maximization
- Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
- Efficient deterministic algorithms for maximizing symmetric submodular functions
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- Non-monotone submodular function maximization under k-system constraint
- Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
- Derandomization for k-submodular maximization
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Deterministic algorithms for submodular maximization problems
- Adaptive robust submodular optimization and beyond
- Budget-feasible mechanism design for non-monotone submodular objectives: offline and online
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid
- An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
- \(k\)-submodular maximization with two kinds of constraints
- On the cut-query complexity of approximating max-cut
- A binary search double greedy algorithm for non-monotone DR-submodular maximization
- Separating coverage and submodular: maximization subject to a cardinality constraint
- The power of subsampling in submodular maximization
- Online risk-averse submodular maximization
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- Fast algorithms for maximizing monotone nonsubmodular functions
- The submodularity of two-stage stochastic maximum-weight independent set problems
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
- Two-stage stochastic max-weight independent set problems
- scientific article; zbMATH DE number 7525506 (Why is no real title available?)
- A survey on double greedy algorithms for maximizing non-monotone submodular functions
- Monotone submodular maximization over the bounded integer lattice with cardinality constraints
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- Deterministic algorithms for multi-criteria max-TSP
- Tight approximation for unconstrained XOS maximization
This page was built for publication: Deterministic Algorithms for Submodular Maximization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554360)
