隐蔽集合覆盖问题及其在网络发现中的应用
The covert set-cover problem with application to Network Discovery
摘要:
我们解决了一个版本的集合覆盖问题,我们不知道最初的集合(因此被称为隐蔽),但我们可以查询一个元素,找出哪些集合包含这个元素,以及查询一个集合知道的元素。我们希望使用最少数量的此类查询找到一个小的集合覆盖。我们提出了一个Monte Carlo随机算法,近似的最佳集覆盖的大小$OPT$内$O(\log N)$因素与高概率使用$O(OPT \cdot \log^2 N)$查询,其中$N$是输入大小。我们应用这种技术的网络发现问题,涉及到验证所有的边缘和非边缘的一个未知的$n$顶点图的分层图查询的基础上,从最小数量的顶点。通过将其归结为隐蔽的集合覆盖问题,我们提出了一个$O(\log^2 n)$ -竞争蒙特卡罗随机算法的隐蔽版本的网络发现问题。以前最著名的算法有一个竞争比$Ω(\sqrt{n\log n})$,因此我们的结果实现了指数级的改善。
英文摘要:
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain this element as well as query a set to know the elements. We want to find a small set-cover using a minimal number of such queries. We present a Monte Carlo randomized algorithm that approximates an optimal set-cover of size $OPT$ within $O(\log N)$ factor with high probability using $O(OPT \cdot \log^2 N)$ queries where $N$ is the input size. We apply this technique to the network discovery problem that involves certifying all the edges and non-edges of an unknown $n$-vertices graph based on layered-graph queries from a minimal number of vertices. By reducing it to the covert set-cover problem we present an $O(\log^2 n)$-competitive Monte Carlo randomized algorithm for the covert version of network discovery problem. The previously best known algorithm has a competitive ratio of $Ω(\sqrt{n\log n})$ and therefore our result achieves an exponential improvement.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。