Abstract
In this paper, we study the non-monotone DR-submodular function maximization over integer lattice. Functions over integer lattice have been defined submodular property that is similar to submodularity of set functions. DR-submodular is a further extended submodular concept for functions over the integer lattice, which captures the diminishing return property. Such functions finds many applications in machine learning, social networks, wireless networks, etc. The techniques for submodular set function maximization can be applied to DR-submodular function maximization, e.g., the double greedy algorithm has a 1/2-approximation ratio, whose running time is O(nB), where n is the size of the ground set, B is the integer bound of a coordinate. In our study, we design a 1/2-approximate binary search double greedy algorithm, and we prove that its time complexity is $$O(n\log B)$$ , which significantly improves the running time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have