Multi-Objective Submodular Optimization with Approximate Oracles and Influence Maximization

Xiaoyun Fu, Rishabh Rajendra Bhatt, Samik Basu, Aduri Pavan

Abstract: We investigate the problem of multi-objective submodular optimization with cardinality constraint in the context of δ-approximate oracle and show that it is possible to ensure (1 − 1/e) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> − 3δ-approximate guarantee for the multi-objective submodular optimization problem. We show that group influence maximization in online social networks is an instance of this optimization problem with cardinality constraint and δ-oracle. We develop a prototype implementation of our solution strategy for group influence maximization problem for networks of different sizes and experimentally justify the effectiveness and scalability of our strategy.