Imagen de Portada

Retroactive Monotonic Priority Queues via Range Searching

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Castro, Lucas, de Freitas, Rosiane
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Exploring Monotone Priority Queues for Dijkstra Optimization
por: Costa, Jonas, et al.
Publicado: (2024)

The Peculiarities of Extending Queue Layouts
por: Depian, Thomas, et al.
Publicado: (2025)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
por: Depian, Thomas, et al.
Publicado: (2025)

Implementation and Brief Experimental Analysis of the Duan et al. (2025) Algorithm for Single-Source Shortest Paths
por: Castro, Lucas, et al.
Publicado: (2025)

Range Counting Oracles for Geometric Problems
por: Driemel, Anne, et al.
Publicado: (2025)

Dynamic Unit-Disk Range Reporting
por: Wang, Haitao, et al.
Publicado: (2024)

Data Structures for Range Sorted Consecutive Occurrence Queries
por: Akram, Waseem, et al.
Publicado: (2024)

Concurrent Double-Ended Priority Queues
por: Fatourou, Panagiota, et al.
Publicado: (2025)

A Query-Driven Approach to Space-Efficient Range Searching
por: Fotakis, Dimitris, et al.
Publicado: (2025)

Simple Compact Monotone Tree Drawings
por: Oikonomou, Anargyros, et al.
Publicado: (2017)

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
por: Gusain, Rachana, et al.
Publicado: (2025)

Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
por: Nekrich, Yakov, et al.
Publicado: (2026)

Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
por: Ahrens, Markus, et al.
Publicado: (2021)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
por: Clementino, Thailsson, et al.
Publicado: (2025)

PIPQ: Strict Insert-Optimized Concurrent Priority Queue
por: Grimes, Olivia, et al.
Publicado: (2025)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
por: Krauthgamer, Robert, et al.
Publicado: (2026)

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
por: Williams, Marvin, et al.
Publicado: (2025)

Maintaining Light Spanners via Minimal Updates
por: Khodabandeh, Hadi, et al.
Publicado: (2024)

Euclidean distance compression via deep random features
por: Leroux, Brett, et al.
Publicado: (2024)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
por: Beurskens, Thijs, et al.
Publicado: (2023)

Faster exponential algorithms for cut problems via geometric data structures
por: Kozma, László, et al.
Publicado: (2025)

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
por: Duan, Hongyi, et al.
Publicado: (2025)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
por: Bhore, Sujoy, et al.
Publicado: (2024)

Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
por: Maus, Victor, et al.
Publicado: (2026)

Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support
por: Browne, Reilly, et al.
Publicado: (2026)

Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
por: Berthe, Gaétan, et al.
Publicado: (2023)

Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
por: Depian, Thomas, et al.
Publicado: (2026)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
por: P V, Althaf, et al.
Publicado: (2026)

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
por: Mitrović, Slobodan, et al.
Publicado: (2026)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
por: de Berg, Sarita, et al.
Publicado: (2023)

The Complexity of Geodesic Spanners
por: de Berg, Sarita, et al.
Publicado: (2023)

The Contiguous Art Gallery Problem is in Θ(n log n)
por: de Berg, Sarita, et al.
Publicado: (2025)

The Complexity of Geodesic Spanners using Steiner Points
por: de Berg, Sarita, et al.
Publicado: (2024)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
por: de Berg, Sarita, et al.
Publicado: (2026)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
por: de Berg, Sarita, et al.
Publicado: (2026)

Graph-Based Nearest-Neighbor Search without the Spread
por: Giliberti, Jeff, et al.
Publicado: (2026)

Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues
por: Thießen, Thore, et al.
Publicado: (2024)

Light Spanners with Small Hop-Diameter
por: Bhore, Sujoy, et al.
Publicado: (2025)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
por: Liu, Shuilian, et al.
Publicado: (2025)