9 citations · 15 across the 6 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
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…
cs.DS2018★ 9 cited
Multi-Level Steiner Trees
Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh +8
In the classical Steiner tree problem, given an undirected, connected graph with non-negative edge costs and a set of \emph{terminals} , the objective is to…