Maximizing the difference of DR-submodular function on the integer lattice
From MaRDI portal
Cites work
- An analysis of approximations for maximizing submodular set functions—I
- Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
- scientific article; zbMATH DE number 5485514 (Why is no real title available?)
- Maximization of constrained non-submodular functions
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint
- Maximizing monotone submodular functions over the integer lattice
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice
- Online submodular welfare maximization: greedy is optimal
- Optimal approximation for submodular and supermodular optimization with bounded curvature
- Polymatroid optimization, submodularity, and joint replenishment games
- Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions
- Submodular function maximization in parallel via the multilinear relaxation
- Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time
- Thresholding Methods for Streaming Submodular Maximization with a Cardinality Constraint and Its Variants
This page was built for publication: Maximizing the difference of DR-submodular function on the integer lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7290100)