Article

Faster kinetic heaps and their use in broadcast scheduling

Authors:

Robert E. Tarjan,

Kostas TsioutsiouliklisAuthors Info & Claims

SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Pages 836 - 844

Published: 09 January 2001 Publication History

Abstract

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.

References

[1]

D. Aksoy and M. Franklin. Scheduling for largescale on-demand data broadcasting. In Proc. IEEE INFOCOM Conf., San Francisco, CA, pages 651-659. IEEE, 1998.]]

[2]

J. Basch Kinetic Data Structures. PhD thesis, Stanford University, June 1999.]]

Digital Library

[3]

J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 747-756, New Orleans, Louisiana, 5-7 January 1997.]]

Digital Library

[4]

J. Bentley and J. Saxe Decomposable searching problems I: Static-to-dynamic transformation". J. of algorithms, 1:301-358, 1980.]]

[5]

G. Brodal and R. Jacob. Dynamic planar convex hull with optimal query time and O(logn. loglogn) update time. In Proc. 7th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science. Springer Verlag, Berlin, 2000.]]

Digital Library

[6]

T. M. Chan Dynamic planar convex hull operations in near-logarithmic amortized time. In Proc. 40th IEEE Annual Symposium on Foundations of Computer Science, pages 92-99. IEEE, 1999.]]

Digital Library

[7]

T. M. Chan Remarks on k-level algorithms in the plane, draft, 1999.]]

[8]

B. Chazelle. On the convex layers of a planar set. IEEEI Transactions on Information Theory, 31, 1985.]]

[9]

B. V. Cherkassky, A. V. Goldberg, and C. Silverstein. Buckets, heaps, lists, and monotone priority queues. SIAM J. Computing, 28:1326-1346, 1999.]]

Digital Library

[10]

M. L. Fredman and It. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596-615, 1987.]]

Digital Library

[11]

J. Hershberger and S. Suri. Applications of a semidynamic convex hull algorithm. BIT, 32:249-267, 1992.]]

Digital Library

[12]

M. H. Overmars and J. van Leeuwen Maintenance of configurations in the plane. J. Comp. and Syst. Sci., 23:166-204, 1981.]]

[13]

D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32:652-686, 1985.]]

Digital Library

[14]

R. E. Tarjan. Data Structures and Network Algorithms CBMS 44. Society for Industrial and applied mathematics, Philadelphia, PA, 1983.]]

Digital Library

[15]

R. E. Tarjan. Amortized computational complexity. SIAM J. on Algebraic and Discrete Methods, 6(2):306- 318, 1985.]]

[16]

R. E. Tarjan and C. J. Van Wyk. An O(nloglogn)- time algorithm for triangulating a simple polygon. Siam J. Computing, 17(1):143-173, 1988.]]

Digital Library

[17]

J. W. Wong. Broadcast delivery. Proc. IEEE, 76(12):1566-1577, 1988.]]

Cited By

Buchin KBuchin MVan Leusden RMeulemans WMulzer W(2016)Computing the Fréchet Distance with a Retractable LeashDiscrete & Computational Geometry10.1007/s00454-016-9800-856:2(315-336)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1007/s00454-016-9800-8
Edmonds JPruhs K(2005)A maiden analysis of longest wait firstACM Transactions on Algorithms10.1145/1077464.10774671:1(14-32)Online publication date: 1-Jul-2005
https://dl.acm.org/doi/10.1145/1077464.1077467
Edmonds JPruhs KMunro I(2004)A maiden analysis of Longest Wait FirstProceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/982792.982915(818-827)Online publication date: 11-Jan-2004
https://dl.acm.org/doi/10.5555/982792.982915
Show More Cited By

Index Terms

Faster kinetic heaps and their use in broadcast scheduling
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation

Recommendations

Thin heaps, thick heaps

The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in practice as other heap implementations. Expanding on ideas of Høyer [1995], we ...
Safe and efficient persistent heaps
Concurrent Garbage Collection of Persistent Heaps

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

January 2001

937 pages

ISBN:0898714907

Chairman:
S. Rao Kosaraju

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM: Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 09 January 2001

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
389
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)3

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Buchin KBuchin MVan Leusden RMeulemans WMulzer W(2016)Computing the Fréchet Distance with a Retractable LeashDiscrete & Computational Geometry10.1007/s00454-016-9800-856:2(315-336)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1007/s00454-016-9800-8
Edmonds JPruhs K(2005)A maiden analysis of longest wait firstACM Transactions on Algorithms10.1145/1077464.10774671:1(14-32)Online publication date: 1-Jul-2005
https://dl.acm.org/doi/10.1145/1077464.1077467
Edmonds JPruhs KMunro I(2004)A maiden analysis of Longest Wait FirstProceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/982792.982915(818-827)Online publication date: 11-Jan-2004
https://dl.acm.org/doi/10.5555/982792.982915
Mount DNetanyahu NPiatko CSilverman RWu ASnoeyink JBoissonnat J(2004)A computational framework for incremental motionProceedings of the twentieth annual symposium on Computational geometry10.1145/997817.997849(200-209)Online publication date: 8-Jun-2004
https://dl.acm.org/doi/10.1145/997817.997849

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents