:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bernstein, Aaron, Wein, Nicole
Format:	Preprint
Publié:	2022
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2207.04507
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Low Sensitivity Hopsets
par: Ashvinkumar, Vikrant, et autres
Publié: (2024)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

Reducing Shortcut and Hopset Constructions to Shallow Graphs
par: Haeupler, Bernhard, et autres
Publié: (2025)

Are there graphs whose shortest path structure requires large edge weights?
par: Bernstein, Aaron, et autres
Publié: (2023)

New Separations and Reductions for Directed Preservers and Hopsets
par: Hoppenworth, Gary, et autres
Publié: (2024)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
par: Chen, Kuowen, et autres
Publié: (2025)

A Unified Framework for Hopsets and Spanners
par: Neiman, Ofer, et autres
Publié: (2021)

Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
par: Bernstein, Aaron, et autres
Publié: (2025)

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
par: Elkin, Michael, et autres
Publié: (2025)

Reviving Thorup's Shortcut Conjecture
par: Bernstein, Aaron, et autres
Publié: (2025)

Improved Online Sorting
par: Nirjhor, Jubayer, et autres
Publié: (2025)

Approximation Algorithms for Optimal Hopsets
par: Dinitz, Michael, et autres
Publié: (2025)

Settling Weighted Token Swapping up to Algorithmic Barriers
par: Wein, Nicole, et autres
Publié: (2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
par: Ashvinkumar, Vikrant, et autres
Publié: (2024)

Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
par: Bodwin, Greg, et autres
Publié: (2023)

Diameter Shortcut Sets on Temporal Graphs
par: Quantmeyer, Gerome
Publié: (2025)

Bounding the Fragmentation of B-Trees Subject to Batched Insertions
par: Bender, Michael A., et autres
Publié: (2026)

Edge-Minimum Walk of Modular Length in Polynomial Time
par: Amarilli, Antoine, et autres
Publié: (2024)

Covering Approximate Shortest Paths with DAGs
par: Assadi, Sepehr, et autres
Publié: (2025)

Improved Hardness-of-Approximation for Token Swapping
par: Hiken, Sam, et autres
Publié: (2024)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
par: Bernstein, Aaron, et autres
Publié: (2025)

Beyond 2-approximation for k-Center in Graphs
par: Jin, Ce, et autres
Publié: (2025)

Detecting Disjoint Shortest Paths in Linear Time and More
par: Akmal, Shyan, et autres
Publié: (2024)

Additive Spanner Lower Bounds with Optimal Inner Graph Structure
par: Bodwin, Greg, et autres
Publié: (2024)

Negative-Weight Single-Source Shortest Paths in Near-linear Time
par: Bernstein, Aaron, et autres
Publié: (2022)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
par: Haeupler, Bernhard, et autres
Publié: (2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
par: Bernstein, Aaron, et autres
Publié: (2025)

Improving the Threshold for Finding Rank-1 Matrices in a Subspace
par: Dastidar, Jeshu, et autres
Publié: (2025)

Tree-Like Shortcuttings of Trees
par: Le, Hung, et autres
Publié: (2025)

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
par: Bernstein, Aaron, et autres
Publié: (2024)

Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
par: Ashvinkumar, Vikrant, et autres
Publié: (2026)

Shortcutting for Negative-Weight Shortest Path
par: Li, George Z., et autres
Publié: (2025)

Shortcuts and Transitive-Closure Spanners Approximation
par: Chalermsook, Parinya, et autres
Publié: (2025)

Matching Composition and Efficient Weight Reduction in Dynamic Matching
par: Bernstein, Aaron, et autres
Publié: (2024)

Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems
par: Bernstein, Aaron, et autres
Publié: (2025)

DAG Covers: The Steiner Point Effect
par: Bhore, Sujoy, et autres
Publié: (2026)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors
par: Assadi, Sepehr, et autres
Publié: (2024)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
par: Li, Xizhe, et autres
Publié: (2026)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
par: Jambulapati, Arun, et autres
Publié: (2024)