Adaptive Influence Maximization: Adaptability via Nonadaptability
提出将自适应影响力最大化问题转化为非自适应问题的方法，并给出一个带背包约束的子模最大化近似算法，性能优于已知同类算法。
Adaptive influence maximization is an important research problem in computational social networks, which is also a typical problem in the study of adaptive processing of information and adaptive construction of objects. In this paper, we propose a new method that reduces the adaptive influence maximization problem into a nonadaptive one in a different social network, so that an adaptive optimization can be solved by those methods for nonadaptive optimization. In addition, we provide a new approximation algorithm for the submodular maximization problem with a knapsack constraint, which runs in [Formula: see text] time and has performance ratio [Formula: see text], where n is the number of nodes in the network. The ratio is better than the best known previous one with the same running time. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This research is supported in part by the National Natural Science Foundation of China [Grant U20A2068].