Image de couverture de livre

Faster Algorithms for $(2k-1)$-Stretch Distance Oracles

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kadria, Avi, Roditty, Liam
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

New approximate distance oracles and their applications
par: Kadria, Avi, et autres
Publié: (2025)

On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch
par: Kopelowitz, Tsvi, et autres
Publié: (2023)

Improved girth approximation in weighted undirected graphs
par: Kadria, Avi, et autres
Publié: (2025)

New Diameter Approximations via Distance Oracle Techniques
par: Kirkpatrick, Yael, et autres
Publié: (2026)

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
par: Roditty, Liam, et autres
Publié: (2026)

Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-offs and Algorithms
par: Roditty, Liam, et autres
Publié: (2025)

New algorithms for girth and cycle detection
par: Roditty, Liam, et autres
Publié: (2025)

Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
par: Boneh, Itai, et autres
Publié: (2025)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
par: Elkin, Michael, et autres
Publié: (2023)

Improved Algorithms for Clustering with Noisy Distance Oracles
par: Pradhan, Pinki, et autres
Publié: (2026)

Faster Combinatorial k-Clique Algorithms
par: Abboud, Amir, et autres
Publié: (2024)

Faster Algorithms for Text-to-Pattern Hamming Distances
par: Chan, Timothy M., et autres
Publié: (2023)

Algorithms for Distance Sensitivity Oracles and other Graph Problems on the PRAM
par: Manoharan, Vignesh, et autres
Publié: (2025)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
par: Kociumaka, Tomasz, et autres
Publié: (2025)

Hamming Distance Oracle
par: Boneh, Itai, et autres
Publié: (2024)

Distributed Distance Sensitivity Oracles
par: Manoharan, Vignesh, et autres
Publié: (2024)

Faster Approximation Algorithms for k-Center via Data Reduction
par: Filtser, Arnold, et autres
Publié: (2025)

Even Faster Algorithm for the Chamfer Distance
par: Feng, Ying, et autres
Publié: (2025)

A Faster $k$-means++ Algorithm
par: Liang, Jiehao, et autres
Publié: (2022)

Improved Distance (Sensitivity) Oracles with Subquadratic Space
par: Bilò, Davide, et autres
Publié: (2024)

Path-Reporting Distance Oracles with Linear Size
par: Neiman, Ofer, et autres
Publié: (2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space
par: Bilò, Davide, et autres
Publié: (2023)

Nearly Optimal Fault Tolerant Distance Oracle
par: Dey, Dipan, et autres
Publié: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
par: la Tour, Max Dupré, et autres
Publié: (2024)

Near Optimal Dual Fault Tolerant Distance Oracle
par: Dey, Dipan, et autres
Publié: (2024)

Path-Reporting Distance Oracles for Vertex-Labeled Graphs
par: Neiman, Ofer, et autres
Publié: (2026)

Fault-Tolerant Approximate Distance Oracles with a Source Set
par: Dey, Dipan, et autres
Publié: (2025)

Faster ED-String Matching with $k$ Mismatches
par: Gawrychowski, Paweł, et autres
Publié: (2025)

Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
par: Horowicz, Noam, et autres
Publié: (2025)

Simple and Faster Algorithms for Knapsack
par: He, Qizheng, et autres
Publié: (2023)

Faster Algorithms for Graph Monopolarity
par: Philip, Geevarghese, et autres
Publié: (2024)

Fault-Tolerant Distance Oracles Below the $n \cdot f$ Barrier
par: Khanna, Sanjeev, et autres
Publié: (2026)

Faster algorithms for k-Orthogonal Vectors in low dimension
par: Dürr, Anita, et autres
Publié: (2025)

Faster two-dimensional pattern matching with $k$ mismatches
par: Ellert, Jonas, et autres
Publié: (2024)

Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles
par: Yan, Shuyi
Publié: (2025)

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
par: Nogler, Jakob, et autres
Publié: (2024)

Faster Algorithms for Longest Common Substring
par: Charalampopoulos, Panagiotis, et autres
Publié: (2021)

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles
par: Harada, Kaito, et autres
Publié: (2024)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
par: Luo, Chunyu, et autres
Publié: (2024)

A Faster Algorithm for Constrained Correlation Clustering
par: Fischer, Nick, et autres
Publié: (2025)