Anthony Wirth

most citedLower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2025

$O (1)$ -Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN

Junhao Gan, Anthony Wirth, Zhuo Zhang

In this paper, we investigate three fundamental problems in the Massively Parallel Computation (MPC) model: (i) grid graph connectivity, (ii) approximate Euclidean Minimum Spanning…

cs.DS2024★ 1 cited

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths

Rajesh Chitnis, Samuel Thomas, Anthony Wirth

Given a graph $G = (V, E)$ and a set $T = {(s_{i}, t_{i}) : 1 \leq i \leq k} \subseteq V \times V$ of $k$ pairs, the $k$ -vertex-disjoint-paths (resp. $k$ -edge-disjoint-paths) problem asks t…

O(1)-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths

$O (1)$ -Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN