Imagen de Portada

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Duan, Ran, Mao, Jiayi, Mao, Xiao, Shu, Xinkai, Yin, Longhui
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Faster Directed Single-Source Shortest Path Algorithm
por: Duan, Ran, et al.
Publicado: (2026)

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

New Sorting Algorithm Wave Sort (W-Sort)
por: Wei, Jia Xu
Publicado: (2025)

Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
por: Antoniadis, Antonios, et al.
Publicado: (2020)

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

Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism
por: Kammer, Frank, et al.
Publicado: (2020)

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

Fast and Simple Sorting Using Partial Information
por: Haeupler, Bernhard, et al.
Publicado: (2024)

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

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

Revisiting Path Contraction and Cycle Contraction
por: Krithika, R., et al.
Publicado: (2024)

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

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

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

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
por: Le, Hung, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

Online Combinatorial Optimization with Graphical Dependencies
por: Gao, Zhimeng, et al.
Publicado: (2025)

Exploiting Low Scanwidth to Resolve Soft Polytomies
por: Bruchhold, Sebastian, et al.
Publicado: (2025)

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

Online computation of normalized substring complexity
por: Kucherov, Gregory, et al.
Publicado: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
por: Gong, Mingyang, et al.
Publicado: (2025)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
por: Lindermayr, Alexander, et al.
Publicado: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
por: Emmerich, Michael
Publicado: (2025)

Hierarchical Exponential Search Via K-Spines
por: Dong, Bob
Publicado: (2025)

Simple in-place yet comparison-optimal Mergesort
por: Siebert, Christian
Publicado: (2025)

On Hardness and Approximation of Broadcasting in Structured Graphs
por: Bringolf, Jeffrey, et al.
Publicado: (2025)

Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
por: Hommelsheim, Felix, et al.
Publicado: (2025)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
por: Kanellopoulos, Sotiris, et al.
Publicado: (2025)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
por: Bouchard, Sébastien, et al.
Publicado: (2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
por: Ahn, Jungho, et al.
Publicado: (2025)

Fast Order Statistics with Group Inequality Testing
por: Liyanage, Adiesha, et al.
Publicado: (2025)

PtrHash: Minimal Perfect Hashing at RAM Throughput
por: Koerkamp, Ragnar Groot
Publicado: (2025)

Counting large patterns in degenerate graphs
por: Awofeso, Christine, et al.
Publicado: (2025)