Fibonacci堆中标记位的随机性替换
Replacing Mark Bits with Randomness in Fibonacci Heaps
摘要:
斐波那契堆是一种确定性的数据结构,它实现了具有最佳摊销操作成本的优先级队列。斐波那契堆的一个不幸的方面是,它们必须维护一个“标记位”,这只用于确保堆操作的效率,而不是正确性。Karger提出了斐波那契堆的一个简单的随机变体,其中标记位被硬币翻转所取代。此变体仍然具有插入、减少键和合并的预期摊销成本$O(1)$。Karger解释说,该数据结构预期delete-min的摊销成本为$O(\log s)$,其中$s$是堆操作的数量。我们给出了一个严格的分析Karger的随机斐波那契堆,解决Karger的猜想。具体来说,我们得到匹配的上,下界的$Θ(\log^2 s / \log \log s)$的delete-min的运行时。我们还证明了一个紧的下界的$Ω(\sqrt{n})$ delete-min的堆元素的数量$n$。用于证明此界限的请求序列也解决了Fredman关于级联切割是否必要的公开问题。最后,我们对这些堆进行了一个简单的附加修改,它为delete-min生成了一个紧凑的运行时$O(\log^2 n / \log \log n)$。
英文摘要:
A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized operation costs. An unfortunate aspect of Fibonacci heaps is that they must maintain a "mark bit" which serves only to ensure efficiency of heap operations, not correctness. Karger proposed a simple randomized variant of Fibonacci heaps in which mark bits are replaced by coin flips. This variant still has expected amortized cost $O(1)$ for insert, decrease-key, and merge. Karger conjectured that this data structure has expected amortized cost $O(\log s)$ for delete-min, where $s$ is the number of heap operations. We give a tight analysis of Karger's randomized Fibonacci heaps, resolving Karger's conjecture. Specifically, we obtain matching upper and lower bounds of $Θ(\log^2 s / \log \log s)$ for the runtime of delete-min. We also prove a tight lower bound of $Ω(\sqrt{n})$ on delete-min in terms of the number of heap elements $n$. The request sequence used to prove this bound also solves an open problem of Fredman on whether cascading cuts are necessary. Finally, we give a simple additional modification to these heaps which yields a tight runtime $O(\log^2 n / \log \log n)$ for delete-min.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。