3 citations · 5 across the 2 of their papers we have counts for
2 papers
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…
cs.DS2018★ 2 cited
Approximation algorithms for the vertex-weighted grade-of-service Steiner tree problem
Faryad Darabi Sahneh, Alon Efrat, Stephen Kobourov +2
Given a graph and a subset of terminals, a \emph{Steiner tree} of is a tree that spans . In the vertex-weighted Steiner tree (VST) problem, each…