A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
From MaRDI portal
Publication:2202007
DOI10.1016/j.tcs.2020.08.011zbMath1455.68276OpenAlexW3073093789MaRDI QIDQ2202007
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient approximation for the generalized assignment problem
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- 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
- Tight Approximation Algorithms for Maximum Separable Assignment Problems
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
- Maximizing Non-monotone Submodular Functions
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Gadgets, Approximation, and Linear Programming
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- Learning submodular functions
- An efficient algorithm for image segmentation, Markov random fields and related problems
- Some optimal inapproximability results
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
This page was built for publication: A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
