在线不相交集合覆盖:随机化并非必要
Online Disjoint Set Covers: Randomization is not Necessary
AI总结:
针对在线不相交集合覆盖问题,论文提出基于新型势函数的确定性算法,达到 O(log^2 n) 竞争比,匹配最佳随机化结果。
摘要:
在在线不相交集合覆盖问题中,超图的边在线揭示,目标是将它们划分为最大数量的不相交集合覆盖。也就是说,超图的 n 个节点在开始时给定,随后一系列超边([n] 的子集)被呈现给算法。对于每条超边,在线算法必须分配一种颜色(一个整数)。一旦输入终止,算法的收益就是对应于有效集合覆盖的颜色数量(即,具有该颜色的超边的并集包含全部 n 个节点)。我们提出一种确定性在线算法,其竞争比为 O(log^2 n),相对于先前的 O(n) 界实现了指数级改进,并与 Emep 等人 [ESA 2019] 的最佳随机化算法性能相匹配。在颜色选择方面,我们的算法使用了一种新颖的势函数,可将其视为条件概率去随机化方法和悲观估计量的在线对应物。在在线算法领域,去随机化得到成功应用的案例很少。与以往方法相比,我们的结果扩展到以下新挑战:(i) 该势函数不仅对 Chernoff 界进行去随机化,还对优惠券收集者问题进行去随机化;(ii) 该最大化问题的 OPT 值没有先验界;(iii) 我们不先生成分数解,而是直接在输入上工作。
英文摘要:
In the online disjoint set covers problem, the edges of a hypergraph are revealed online, and the goal is to partition them into a maximum number of disjoint set covers. That is, n nodes of a hypergraph are given at the beginning, and then a sequence of hyperedges (subsets of [n]) is presented to an algorithm. For each hyperedge, an online algorithm must assign a color (an integer). Once an input terminates, the gain of the algorithm is the number of colors that correspond to valid set covers (i.e., the union of hyperedges that have that color contains all n nodes). We present a deterministic online algorithm that is O(log^2 n)-competitive, exponentially improving on the previous bound of O(n) and matching the performance of the best randomized algorithm by Emek et al. [ESA 2019]. For color selection, our algorithm uses a novel potential function, which can be seen as an online counterpart of the derandomization method of conditional probabilities and pessimistic estimators. There are only a few cases where derandomization has been successfully used in the field of online algorithms. In contrast to previous approaches, our result extends to the following new challenges: (i) the potential function derandomizes not only the Chernoff bound, but also the coupon collector's problem, (ii) the value of OPT of the maximization problem is not bounded a priori, and (iii) we do not produce a fractional solution first, but work directly on the input.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。