Copertina

A Faster Directed Single-Source Shortest Path Algorithm

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Duan, Ran, Mao, Xiao, Shu, Xinkai, Yin, Longhui
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
di: Duan, Ran, et al.
Pubblicazione: (2025)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
di: de Berg, Mark, et al.
Pubblicazione: (2026)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
di: Chuzhoy, Julia, et al.
Pubblicazione: (2025)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
di: Balzotti, Lorenzo
Pubblicazione: (2020)

An Algorithm for a Variation of the Shortest Common Superstring Problem
di: Gilfanov, Arthur
Pubblicazione: (2024)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
di: Mosenzon, Ron
Pubblicazione: (2025)

Faster shortest-path algorithms using the acyclic-connected tree
di: Stefansson, Elis, et al.
Pubblicazione: (2025)

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
di: Saha, Barna, et al.
Pubblicazione: (2024)

Approximately Partitioning Vertices into Short Paths
di: Gong, Mingyang, et al.
Pubblicazione: (2026)

Revisiting Path Contraction and Cycle Contraction
di: Krithika, R., et al.
Pubblicazione: (2024)

On the Approximability of Unsplittable Flow on a Path with Time Windows
di: Armbruster, Alexander, et al.
Pubblicazione: (2025)

Streaming Algorithms for Bin Packing and Vector Scheduling
di: Cormode, Graham, et al.
Pubblicazione: (2019)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
di: Goldenberg, Elazar, et al.
Pubblicazione: (2022)

Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
di: Chen, Lin, et al.
Pubblicazione: (2025)

New Sorting Algorithm Wave Sort (W-Sort)
di: Wei, Jia Xu
Pubblicazione: (2025)

Minimizing the Weighted Makespan with Restarts on a Single Machine
di: Amouzandeh, Aflatoun, et al.
Pubblicazione: (2025)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
di: Chakrabarti, Amit, et al.
Pubblicazione: (2024)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
di: Bauernöppel, Frank, et al.
Pubblicazione: (2025)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
di: Goswami, Mayank, et al.
Pubblicazione: (2022)

Faster algorithms on linear delta-matroids
di: Koana, Tomohiro, et al.
Pubblicazione: (2024)

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

Approximation Algorithms for Action-Reward Query-Commit Matching
di: Derakhshan, Mahsa, et al.
Pubblicazione: (2026)

Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
di: Marica, Edina, et al.
Pubblicazione: (2026)

Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries
di: Kaudan, Chirag, et al.
Pubblicazione: (2026)

Multiplication of 0-1 matrices via clustering
di: Jansson, Jesper, et al.
Pubblicazione: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
di: Kowaluk, Mirosław, et al.
Pubblicazione: (2025)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
di: Faour, Salwa, et al.
Pubblicazione: (2025)

A faster algorithm for the construction of optimal factoring automata
di: Erlebach, Thomas, et al.
Pubblicazione: (2024)

A Tight Lower Bound for Comparison-Based Quantile Summaries
di: Cormode, Graham, et al.
Pubblicazione: (2019)

A $2$-branching construction for the $χ\leq 2r$ bound
di: Date, Vinicius Tikara Venturi, et al.
Pubblicazione: (2026)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
di: Randolph, Tim, et al.
Pubblicazione: (2024)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
di: Bonnet, Édouard, et al.
Pubblicazione: (2026)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
di: Awofeso, Christine, et al.
Pubblicazione: (2025)

A Framework for Algorithm Stability
di: Meulemans, Wouter, et al.
Pubblicazione: (2017)

Offline green bin packing and its constrained variant
di: Gong, Mingyang, et al.
Pubblicazione: (2026)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
di: Blomer, Valentin, et al.
Pubblicazione: (2026)

Search and evacuation with a near majority of faulty agents
di: Czyzowicz, J., et al.
Pubblicazione: (2026)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
di: Bergougnoux, Benjamin, et al.
Pubblicazione: (2026)

SimdQuickHeap: The QuickHeap Reconsidered
di: Breitling, Johannes, et al.
Pubblicazione: (2026)

On the Online Weighted Non-Crossing Matching Problem
di: Boyar, Joan, et al.
Pubblicazione: (2026)