Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
Data Structures and Algorithms
2018-05-21 v1
Abstract
The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a non-submodular function on the integer lattice subject to a cardinality constraint; these are the first algorithms for this purpose that have polynomial query complexity. We propose a general framework for influence maximization on the integer lattice that generalizes prior works on this topic, and we demonstrate the efficiency of our algorithms in this context.
Cite
@article{arxiv.1805.06990,
title = {Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice},
author = {Alan Kuhnle and J. David Smith and Victoria G. Crawford and My T. Thai},
journal= {arXiv preprint arXiv:1805.06990},
year = {2018}
}