arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.06204cs.DScs.CCcs.CGcs.DM
收藏

基于近似随机化的近似集并

Approximate Set Union Via Approximate Randomization

Bin Fu, Pengfei Gu, Yuming Zhao

摘要:

本文提出了一种求解集合并问题$\arrowvert A_1\cup A_2\cup...\cup A_m\arrowvert$的随机近似算法,给出了一个集合列表$A_1,...,A_m$,其近似集合大小为$A_i$和$m_i\in \left((1-β_L)|A_i|, (1+β_R)|A_i|\right)$,以及有偏随机生成器,其中每个输入集合$A_i$和元素$x\in A_i,$都有$Prob(x=\randomElm(A_i))\in \left[{1-α_L\over |A_i|},{1+α_R\over |A_i|}\right]$,其中$i=1, 2, ..., m$ .对于任何$ε\in (0,1)$,$\arrowvert A_1\cup A_2\cup...\cup A_m\arrowvert$的近似比在$[(1-ε)(1-α_L)(1-β_L), (1+ε)(1+α_R)(1+β_R)]$范围内,其中$α_L, α_R, β_L,β_R\in (0,1)$。算法的复杂度由时间复杂度和轮复杂度来衡量。该算法允许进行多个成员查询,并在一轮中从输入集中获得随机元素。我们的算法使自适应访问输入集多轮。我们的算法给出了一个近似方案与$O(\setCount\cdot(\log \setCount)^{O(1)})$运行时间和$O(\log m)$轮,其中$m$是集合的数量。我们的算法可以处理输入集,可以产生随机元素的偏见,其近似比取决于偏见。我们的算法给出了一个灵活的折衷与时间复杂度$O\left(\setCount^{1+ξ}\right)$和轮复杂度$O\left({1\over ξ}\right)$的任何$ξ\in(0,1)$。

英文摘要:

We develop an randomized approximation algorithm for the size of set union problem $\arrowvert A_1\cup A_2\cup...\cup A_m\arrowvert$, which given a list of sets $A_1,...,A_m$ with approximate set size $m_i$ for $A_i$ with $m_i\in \left((1-β_L)|A_i|, (1+β_R)|A_i|\right)$, and biased random generators with $Prob(x=\randomElm(A_i))\in \left[{1-α_L\over |A_i|},{1+α_R\over |A_i|}\right]$ for each input set $A_i$ and element $x\in A_i,$ where $i=1, 2, ..., m$. The approximation ratio for $\arrowvert A_1\cup A_2\cup...\cup A_m\arrowvert$ is in the range $[(1-ε)(1-α_L)(1-β_L), (1+ε)(1+α_R)(1+β_R)]$ for any $ε\in (0,1)$, where $α_L, α_R, β_L,β_R\in (0,1)$. The complexity of the algorithm is measured by both time complexity, and round complexity. The algorithm is allowed to make multiple membership queries and get random elements from the input sets in one round. Our algorithm makes adaptive accesses to input sets with multiple rounds. Our algorithm gives an approximation scheme with $O(\setCount\cdot(\log \setCount)^{O(1)})$ running time and $O(\log m)$ rounds, where $m$ is the number of sets. Our algorithm can handle input sets that can generate random elements with bias, and its approximation ratio depends on the bias. Our algorithm gives a flexible tradeoff with time complexity $O\left(\setCount^{1+ξ}\right)$ and round complexity $O\left({1\over ξ}\right)$ for any $ξ\in(0,1)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑