分层堆在实践中击败标准堆和Fibonacci堆
Layered Heaps Beating Standard and Fibonacci Heaps in Practice
摘要:
我们考虑设计堆的经典问题。标准的二进制堆在实践中比斐波那契堆运行得更快,但时间保证较差。在这里,我们提出了一种新类型的堆,分层堆,在实践中运行速度比标准的二进制和斐波那契堆,但渐近插入时间优于二进制堆。我们的堆是递归定义的,当使用递归深度1时,即堆的堆,运行时间加速最大。
英文摘要:
We consider the classic problem of designing heaps. Standard binary heaps run faster in practice than Fibonacci heaps but have worse time guarantees. Here we present a new type of heap, a layered heap, that runs faster in practice than both standard binary and Fibonacci heaps, but has asymptotic insert times better than that of binary heaps. Our heap is defined recursively and maximum run time speed up occurs when a recursion depth of 1 is used, i.e. a heap of heaps.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。