Faster kinetic heaps and their use in broadcast scheduling
SODA(2001)
摘要
We describe several implementations of the kinetic heap, a heap (priority queue) in which the key of each item, instead of being fixed, is a linear function of time. The kinetic heap is a simple example of a kinetic data structure of the kind considered by Basch, Guibas, and Hershberger. Kinetic heaps have many applications in computational geometry, and previous implementations were designed to address these applications. We describe an additional application, to broadcast scheduling. Each of our kinetic heap implementations improves on previous implementations by being simpler or asymptotically faster for some or all applications.
更多查看译文
关键词
faster kinetic heap,broadcast scheduling,kinetics,clique width,dominating set,priority queue,edge coloring
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络