9 citations · 15 across the 6 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DM2020
Weighted Additive Spanners
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh +2
A \emph{spanner} of a graph is a subgraph that approximately preserves shortest path distances in . Spanners are commonly applied to compress computation on metric space…
cs.DS2020★ 3 cited
Kruskal-based approximation algorithm for the multi-level Steiner tree problem
Reyan Ahmed, Faryad Darabi Sahneh, Keaton Hamm +2
We study the multi-level Steiner tree problem: a generalization of the Steiner tree problem in graphs where terminals require varying priority, level, or quality of service. In…