Dynamic rectangular intersection with priorities
From MaRDI portal
Publication:3581261
DOI10.1145/780542.780635zbMath1192.68180OpenAlexW2049761335MaRDI QIDQ3581261
Haim Kaplan, Eyal Molad, Robert Endre Tarjan
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780635
Related Items (5)
Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals ⋮ I/O efficient dynamic data structures for longest prefix queries ⋮ Dynamic algorithms for monotonic interval scheduling problem ⋮ Two-dimensional packet classification and filter conflict resolution in the internet ⋮ Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
This page was built for publication: Dynamic rectangular intersection with priorities
