By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for ...

LAIM: A Linear Time Iterative Approach for Efficient Influence Maximization in Large-Scale Networks Abstract: The problem of influence maximization (IM) has been extensively studied in recent years ...