TL;DR本文研究基于在线变体的子模函数最大化问题,探讨了两种特殊情况并得出了竞争比的上下界。具体而言,设计了一个 $1/e$ 竞争算法和一个针对最多只包含 k 个元素的解的常数竞争比算法。
Abstract
submodular function maximization has been studied extensively in recent years
under various constraints and models. The problem plays a major role in various
disciplines. We study a natural online variant of this