Profit maximization problem with coupons in social networks (Q6049082): Difference between revisions

This paper studies profit maximization problem with coupons in social networks. The paper presents profit maximization problem with coupons problem a PMCA algorithm runs in \(O(\ln np\cdot mn^3\ln n(l\ln n+n\ln 2)/\varepsilon^3)\) expected time and can return a \(1/3-\varepsilon\)-approximate solution with a high probability, where \(G\) is the given network with \(n\) nodes and \(m\) edges, and price of a product \(p>0\), \(\varepsilon\in(0,1)\), \(l>0\). Based on the reverse reachable set, the paper proposes modified-reverse reachable set with is more suitable under the linear threshold-coupons and valuations diffusion model. For the entire collection see [Zbl 1400.68037].