Fast 2-approximate all-pairs shortest paths
In this paper, we revisit the classic approximate All-Pairs Shortest Paths (APSP) problem in
undirected graphs. For unweighted graphs, we provide an algorithm for 2-approximate …
undirected graphs. For unweighted graphs, we provide an algorithm for 2-approximate …
[HTML][HTML] Improved bounds for rectangular monotone min-plus product and applications
A Dürr - Information Processing Letters, 2023 - Elsevier
In a recent breakthrough paper, Chi et al.(STOC'22) introduce an O˜(n 3+ ω 2) time algorithm
to compute Monotone Min-Plus Product between two square matrices of dimensions n× n …
to compute Monotone Min-Plus Product between two square matrices of dimensions n× n …
Faster Approximate All Pairs Shortest Paths
The all pairs shortest path problem (APSP) is one of the foundational problems in computer
science. For weighted dense graphs on n vertices, no truly sub-cubic algorithms exist to …
science. For weighted dense graphs on n vertices, no truly sub-cubic algorithms exist to …
Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication
We study the computational complexity of several polynomial-time-solvable graph problems
parameterized by vertex integrity, a measure of a graph's vulnerability to vertex removal in …
parameterized by vertex integrity, a measure of a graph's vulnerability to vertex removal in …
New algorithms for all pairs approximate shortest paths
L Roditty - Proceedings of the 55th Annual ACM Symposium on …, 2023 - dl.acm.org
Let G=(V, E) be an unweighted undirected graph with n vertices and m edges. Dor, Halperin,
and Zwick [FOCS 1996, SICOMP 2000] presented an (min {n 3/2 m 1/2, n 7/3})-time …
and Zwick [FOCS 1996, SICOMP 2000] presented an (min {n 3/2 m 1/2, n 7/3})-time …
New tradeoffs for decremental approximate all-pairs shortest paths
We provide new tradeoffs between approximation and running time for the decremental all-
pairs shortest paths (APSP) problem. For undirected graphs with $ m $ edges and $ n …
pairs shortest paths (APSP) problem. For undirected graphs with $ m $ edges and $ n …