40 citations · 158 across the 22 of their papers we have counts for
5 papers · 1 filter
Multi-Priority Graph Sparsification
Reyan Ahmed, Keaton Hamm, Stephen Kobourov +3
A \emph{sparsification} of a given graph is a sparser graph (typically a subgraph) which aims to approximate or preserve some property of . Examples of sparsifications inclu…
Approximation algorithms for priority Steiner tree problems
Faryad Darabi Sahneh, Stephen Kobourov, Richard Spence
In the Priority Steiner Tree (PST) problem, we are given an undirected graph with a source and terminals , where each terminal $v…
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…
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…
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…