A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
From MaRDI portal
Publication:2202007
DOI10.1016/J.TCS.2020.08.011zbMATH Open1455.68276OpenAlexW3073093789MaRDI QIDQ2202007FDOQ2202007
Yan Feng, Xiaoying Qu, Qingqin Nong, Suning Gong, Jiazhu Fang
Publication date: 17 September 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.08.011
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
- Maximizing monotone submodular functions over the integer lattice
- Maximizing monotone submodular functions over 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
- Tight approximation algorithms for maximum separable assignment problems
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- An efficient approximation for the generalized assignment problem
- Gadgets, Approximation, and Linear Programming
- Some optimal inapproximability results
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Maximizing Non-monotone Submodular Functions
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- Title not available (Why is that?)
- Learning submodular functions
- Title not available (Why is that?)
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- An efficient algorithm for image segmentation, Markov random fields and related problems
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
- Submodular Function Maximization on the Bounded Integer Lattice
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
Cited In (7)
- Title not available (Why is that?)
- Profit maximization in social networks and non-monotone DR-submodular maximization
- 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
- A binary search double greedy algorithm for non-monotone DR-submodular maximization
- Maximizing monotone submodular functions over the integer lattice
- A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity
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)
