Cover Image

Simpler Universally Optimal Dijkstra

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	van der Hoog, Ivor, Rotenberg, Eva, Rutschmann, Daniel
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simpler Optimal Sorting from a Directed Acyclic Graph
by: van der Hoog, Ivor, et al.
Published: (2024)

Near-Optimal Heaps and Dijkstra on Pointer Machines
by: van der Hoog, Ivor, et al.
Published: (2026)

Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection
by: van der Hoog, Ivor, et al.
Published: (2025)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

Tight Bounds for Sorting Under Partial Information
by: van der Hoog, Ivor, et al.
Published: (2024)

Efficient Greedy Discrete Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2025)

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

On computing the (exact) Fréchet distance with a frog
by: Conradi, Jacobus, et al.
Published: (2025)

Engineering Fully Dynamic Convex Hulls
by: van der Hoog, Ivor, et al.
Published: (2026)

Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
by: Conradi, Jacobus, et al.
Published: (2026)

Local Density and its Distributed Approximation
by: Christiansen, Aleksander Bjørn, et al.
Published: (2024)

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

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
by: Großmann, Ernestine, et al.
Published: (2025)

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

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
by: Rutschmann, Daniel
Published: (2026)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
by: Gæde, Emil Toftegaard, et al.
Published: (2025)

The Presort Hierarchy for Geometric Problems
by: van der Hoog, Ivor, et al.
Published: (2026)

A Coalgebraic Dijkstra Algorithm
by: Sanada, Takahiro, et al.
Published: (2026)

3SUM in Preprocessed Universes: Faster and Simpler
by: Kasliwal, Shashwat, et al.
Published: (2024)

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

Generic Dijkstra
by: Szcześniak, Ireneusz, et al.
Published: (2022)

Simpler and Improved Replacement Path Coverings
by: Bilò, Davide, et al.
Published: (2026)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
by: Haeupler, Bernhard, et al.
Published: (2023)

Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
by: Holm, Jacob, et al.
Published: (2025)

Sparsity-Parameterised Dynamic Edge Colouring
by: Christiansen, Aleksander B. G., et al.
Published: (2023)

Simpler and Faster Directed Low-Diameter Decompositions
by: Li, Jason
Published: (2025)

Finding 4-Additive Spanners: Faster, Stronger, and Simpler
by: Qi, Chuhan
Published: (2025)

Faster and Simpler Online Computation of String Net Frequency
by: Inenaga, Shunsuke
Published: (2024)

Simpler O(1) Query Algorithm for Level Ancestors
by: Saxena, Sanjeev
Published: (2022)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
by: Haeupler, Bernhard, et al.
Published: (2024)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
by: Gupta, Anupam, et al.
Published: (2026)

Adapting Dijkstra for Buffers and Unlimited Transfers
by: Katkalo, Denys, et al.
Published: (2026)

Private graph colouring with limited defectiveness
by: Christiansen, Aleksander B. G., et al.
Published: (2024)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
by: Beines, Arne, et al.
Published: (2024)

Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults
by: Parter, Merav, et al.
Published: (2024)

String Indexing for Top-$k$ Close Consecutive Occurrences
by: Bille, Philip, et al.
Published: (2020)

Node-Weighted Triangles: Faster and Simpler
by: Akmal, Shyan, et al.
Published: (2026)

AbsInf: A Lightweight Object to Represent float('inf') in Dijkstra's Algorithm
by: Bellamkonda, Anjan, et al.
Published: (2025)