DR-submodular maximization and its application
From MaRDI portal
Cites work
- A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems
- A combinatorial strongly polynomial algorithm for minimizing submodular functions
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
- A note on maximizing a submodular set function subject to a knapsack constraint
- A refined analysis of submodular greedy
- A threshold of ln n for approximating set cover
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- An analysis of approximations for maximizing submodular set functions—I
- Comparing apples and oranges: query trade-off in submodular maximization
- Constrained submodular maximization via a nonsymmetric technique
- Constrained submodular maximization: beyond 1/e
- Dependent randomized rounding via exchange properties of combinatorial structures
- Deterministic algorithm and faster algorithm for submodular maximization subject to a matroid constraint
- Fast algorithms for maximizing submodular functions
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3580314 (Why is no real title available?)
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 7255156 (Why is no real title available?)
- Improved approximations for k-exchange systems (extended abstract)
- Improved deterministic algorithms for non-monotone submodular maximization
- Maximization of submodular functions: theory and enumeration algorithms
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing Non-monotone Submodular Functions
- Maximizing stochastic set function under a matroid constraint from decomposition
- Maximizing the ratio of monotone DR-submodular functions on integer lattice
- Monotone submodular maximization over a matroid via non-oblivious local search
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Novel algorithms for maximum DS decomposition
- On maximizing sums of non-monotone submodular and linear functions
- Optimal approximation for the submodular welfare problem in the value oracle model
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Practical budgeted submodular maximization
- Regularized nonmonotone submodular maximization
- Simple deterministic approximation for submodular multiple knapsack problem
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular functions: from discrete to continuous domains
- Submodular maximization by simulated annealing
- Submodular maximization with cardinality constraints
- Symmetry and approximability of submodular maximization problems
- Ultramodular Functions
This page was built for publication: DR-submodular maximization and its application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7297942)
