下单调约束下 $k$-子模最大化的统一连续贪心算法
A unified continuous greedy algorithm for $k$-submodular maximization under a down-monotone constraint
AI总结:
针对下单调约束下的 $k$-子模最大化问题,提出基于多线性扩展与舍入的统一连续贪心算法,多项式时间内分别在非单调和单调情形取得 $1/e-o(1)$ 与 $1-1/e-o(1)$ 近似比。
摘要:
$k$-子模函数是子模集合函数的一种推广。许多实际应用都可以建模为 $k$-子模函数最大化,例如多合作博弈、具有 $k$ 类传感器的传感器布置、具有 $k$ 个主题的影响力最大化,以及具有 $k$ 个分区的特征选择。本文针对下单调约束下的 $k$-子模最大化问题,提出了一种统一的连续贪心算法。我们的技术包括:利用 $k$-子模函数的多线性扩展,在连续空间中松弛离散变量以寻找分数解,然后对其进行舍入以获得可行解。所提算法以多项式时间运行,并且可同时应用于非单调和单调情形。当目标函数非单调时,我们的算法实现 $(1/e-o(1))$ 的近似比;对于单调 $k$-子模目标函数,它实现 $(1-1/e-o(1))$ 的近似比。
英文摘要:
A $k$-submodular function is a generalization of the submodular set function. Many practical applications can be modeled as maximizing a $k$-submodular function, such as multi-cooperative games, sensor placement with $k$ type sensors, influence maximization with $k$ topics, and feature selection with $k$ partitions. In this paper, we provide a unified continuous greedy algorithm for $k$-submodular maximization problem under a down-monotone constraint. Our technique involves relaxing the discrete variables in a continuous space by using the multilinear extension of $k$-submodular function to find a fractional solution, and then rounding it to obtain the feasible solution. Our proposed algorithm runs in polynomial time and can be applied to both the non-monotone and monotone cases. When the objective function is non-monotone, our algorithm achieves an approximation ratio of $(1/e-o(1))$; for a monotone $k$-submodular objective function, it achieves an approximation ratio of $(1-1/e-o(1))$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。