Image de couverture de livre

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Haeupler, Bernhard, Hladík, Richard, Rozhoň, Václav, Tarjan, Robert E., Tětek, Jakub
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms F.2.2; G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Bidirectional Dijkstra's Algorithm is Instance-Optimal
par: Haeupler, Bernhard, et autres
Publié: (2024)

Fast and Simple Sorting Using Partial Information
par: Haeupler, Bernhard, et autres
Publié: (2024)

Maintaining Routing Structures under Deletions via Self-Pruning
par: Haeupler, Bernhard, et autres
Publié: (2025)

Efficiency of Self-Adjusting Heaps
par: Sinnamon, Corwin, et autres
Publié: (2023)

SimdQuickHeap: The QuickHeap Reconsidered
par: Breitling, Johannes, et autres
Publié: (2026)

Structural Parameterization of Steiner Tree Packing
par: Hastrich, Niko, et autres
Publié: (2025)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
par: Wang, Xin, et autres
Publié: (2025)

Customizable Contraction Hierarchies -- A Survey
par: Bläsius, Thomas, et autres
Publié: (2025)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
par: Balzotti, Lorenzo
Publié: (2020)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
par: Dreier, Jan, et autres
Publié: (2026)

Faster shortest-path algorithms using the acyclic-connected tree
par: Stefansson, Elis, et autres
Publié: (2025)

Graph Threading
par: Demaine, Erik D., et autres
Publié: (2023)

Approximation Algorithms for Action-Reward Query-Commit Matching
par: Derakhshan, Mahsa, et autres
Publié: (2026)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
par: Le, Hung, et autres
Publié: (2023)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
par: Ibrahimpur, Sharat, et autres
Publié: (2025)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
par: Kumar, Nikhil, et autres
Publié: (2025)

Multiplication of 0-1 matrices via clustering
par: Jansson, Jesper, et autres
Publié: (2025)

Deterministic Minimum Steiner Cut in Maximum Flow Time
par: Ding, Matthew, et autres
Publié: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
par: Eiben, Eduard, et autres
Publié: (2023)

Graph Threading with Turn Costs
par: Demaine, Erik D., et autres
Publié: (2024)

Forward-backward Contention Resolution Schemes for Fair Rationing
par: Ma, Will, et autres
Publié: (2025)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
par: Dvořák, Pavel, et autres
Publié: (2017)

A polynomial-time algorithm for recognizing high-bandwidth graphs
par: Varona, Luis M. B.
Publié: (2026)

Realizing temporal graphs from fastest travel times
par: Klobas, Nina, et autres
Publié: (2023)

A Piecewise Approach for the Analysis of Exact Algorithms
par: Clinch, Katie, et autres
Publié: (2024)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
par: Kumar, Nikhil, et autres
Publié: (2025)

Backdoors for Quantified Boolean Formulas
par: Eriksson, Leif, et autres
Publié: (2026)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
par: Dabrowski, Konrad K., et autres
Publié: (2024)

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
par: Mukherjee, Sayan, et autres
Publié: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
par: Kowaluk, Mirosław, et autres
Publié: (2025)

Online Bipartite Matching in the Probe-Commit Model
par: Borodin, Allan, et autres
Publié: (2023)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
par: Bampis, Evripidis, et autres
Publié: (2024)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
par: Ma, Will, et autres
Publié: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
par: MacRury, Calum, et autres
Publié: (2022)

Finding Diverse Minimum s-t Cuts
par: de Berg, Mark, et autres
Publié: (2023)

Minimum-cost paths for electric cars
par: Dorfman, Dani, et autres
Publié: (2024)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
par: Lindermayr, Alexander, et autres
Publié: (2025)

Connected Components in Linear Work and Near-Optimal Time
par: Farhadi, Alireza, et autres
Publié: (2023)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)