27 citations · 82 across the 20 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Greedy Algorithms for Shortcut Sets and Hopsets
Ben Bals, Joakim Blikstad, Greg Bodwin +3
For many popular graph metric sparsifiers, such as spanners, emulators, and preservers, simple and elegant greedy algorithms are known that achieve state-of-the-art or existentiall…
cs.DS2025
Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
Emilio Cruciani, Sebastian Forster, Tijn de Vos
We study a multi-call variant of the classic PUSH&PULL rumor spreading process where nodes can contact of their neighbors instead of a single one during both PUSH and PULL oper…