40 citations · 158 across the 22 of their papers we have counts for
Showing 2018Show all
3 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.SI2018★ 30 cited
Contact Adaption during Epidemics: A Multilayer Network Formulation Approach
Faryad Darabi Sahneh, Aram Vajdi, Joshua Melander +1
People change their physical contacts as a preventive response to infectious disease propagations. Yet, only a few mathematical models consider the coupled dynamics of the disease…
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…