arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.6665cs.DS
收藏

纯堆模型中递减键的一个严格下界

A Tight Lower Bound for Decrease-Key in the Pure Heap Model

John Iacono, Özgür Özkan

摘要:

我们改进了纯堆模型中的减键操作的摊销成本的下限,并表明任何纯堆模型堆(具有\bigoh{\log n}摊销时间提取最小操作)必须花费\bigom{\log\log n}摊销时间在减键操作上。我们的结果表明,排序堆以及众多其他堆的纯堆变体在纯堆模型中具有渐近最优的减键操作。此外,我们改进的下界匹配Fredman [J. ACM 46(4):473-501(1999)]对于配对堆的下界[M.L.弗雷德曼河Sedgewick,D. D. Sleator和R.E.塔扬111-129(1986)],并超过了许多其他堆的纯堆变体,如指针秩配对堆。

英文摘要:

We improve the lower bound on the amortized cost of the decrease-key operation in the pure heap model and show that any pure-heap-model heap (that has a \bigoh{\log n} amortized-time extract-min operation) must spend \bigom{\log\log n} amortized time on the decrease-key operation. Our result shows that sort heaps as well as pure-heap variants of numerous other heaps have asymptotically optimal decrease-key operations in the pure heap model. In addition, our improved lower bound matches the lower bound of Fredman [J. ACM 46(4):473-501 (1999)] for pairing heaps [M.L. Fredman, R. Sedgewick, D.D. Sleator, and R.E. Tarjan. Algorithmica 1(1):111-129 (1986)] and surpasses it for pure-heap variants of numerous other heaps with augmented data such as pointer rank-pairing heaps.

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

↑