A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
From MaRDI portal
Publication:2202007
Recommendations
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint
- scientific article; zbMATH DE number 7255156
- Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice
- A binary search double greedy algorithm for non-monotone DR-submodular maximization
- An optimal streaming algorithm for non-submodular functions maximization on the integer lattice
- Submodular function maximization on the bounded integer lattice
Cites work
- scientific article; zbMATH DE number 3559283 (Why is no real title available?)
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- An efficient algorithm for image segmentation, Markov random fields and related problems
- An efficient approximation for the generalized assignment problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Gadgets, Approximation, and Linear Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Learning submodular functions
- Maximizing Non-monotone Submodular Functions
- Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
- Some optimal inapproximability results
- Submodular function maximization on the bounded integer lattice
- Submodular maximization by simulated annealing
- Tight approximation algorithms for maximum separable assignment problems
Cited in
(10)- scientific article; zbMATH DE number 7255156 (Why is no real title available?)
- Profit maximization in social networks and non-monotone DR-submodular maximization
- Maximizing the differences between a monotone DR-submodular function and a linear function on the integer lattice
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice
- Submodular function maximization on the bounded integer lattice
- A binary search double greedy algorithm for non-monotone DR-submodular maximization
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
This page was built for publication: A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202007)
