Billboard Advertisement has emerged as an effective out-of-home advertisement technique and adopted by many commercial houses. In this case, the billboards are owned by some companies and they are provided to the commercial houses slot\mbox{-}wise on a payment basis. Now, given the database of billboards along with their slot information which $k$ slots should be chosen to maximize the influence. Formally, we call this problem as the \textsc{Influential Billboard Slot Selection} Problem. In this paper, we pose this problem as a combinatorial optimization problem. Under the `triggering model of influence', the influence function is non-negative, monotone, and submodular. However, as the incremental greedy approach for submodular function maximization does not scale well along with the size of the problem instances, there is a need to develop efficient solution methodologies for this problem.
翻译:广告牌广告已经成为一种有效的家庭外广告技术,并被许多商业公司采纳。 在这种情况下,广告牌为一些公司所有,并且以付款方式提供给商业公司。现在,鉴于广告牌数据库及其应选择的K美元空档以最大限度地扩大影响的位置信息,我们正式将这一问题称为“Textsc{Infential Ballboard Slot tection}问题 ” 。在本文中,我们将此问题作为组合式优化问题提出。在“触发影响模式”下,影响功能是非负、单调和亚调的。然而,由于亚模式功能最大化的逐渐贪婪方法与问题的规模不同,因此有必要为这一问题制定有效的解决方案方法。