27 citations · 82 across the 20 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Faster Randomized and Deterministic k-Clustering on Graphs
Sebastian Forster, Yasamin Nazari, Rajath Rao K. N. +1
In this paper, we study the -clustering and -center problems on graphs, where -clustering generalizes the -median () and -means () problems. We obt…
cs.DS2026
A General Reduction from Near-Additive Emulators to Near-Exact Hopsets
Julian Aeri, Sebastian Forster, Mara Grilnberger
Graph emulators and hopsets are two fundamental concepts for distance approximation. When the multiplicative stretch is for arbitrarily small , these structures are know…
cs.DS2026
Fully Dynamic Spectral Sparsification for Directed Hypergraphs
Sebastian Forster, Gramoz Goranci, Ali Momeni
There has been a surge of interest in spectral hypergraph sparsification, a natural generalization of spectral sparsification for graphs. In this paper, we present a simple fully d…