
Approximation algorithms for priority Steiner tree problems
In the Priority Steiner Tree (PST) problem, we are given an undirected g...
read it

Computing Steiner Trees using Graph Neural Networks
Graph neural networks have been successful in many learning problems and...
read it

Multilevel Weighted Additive Spanners
Given a graph G = (V,E), a subgraph H is an additive +β spanner if _H(u,...
read it

Kruskalbased approximation algorithm for the multilevel Steiner tree problem
We study the multilevel Steiner tree problem: a generalization of the S...
read it

Weighted Additive Spanners
An αadditive spanner of an undirected graph G=(V, E) is a subgraph H su...
read it

Graph Spanners: A Tutorial Review
This tutorial review provides a guiding reference to researchers who wan...
read it

A General Framework for Multilevel Subsetwise Graph Sparsifiers
Given an undirected weighted graph $G(V,E)$, a subsetwise sparsifier ove...
read it

Approximation algorithms and an integer program for multilevel graph spanners
Given a weighted graph G(V,E) and t > 1, a subgraph H is a tspanner of...
read it

Computing VertexWeighted MultiLevel Steiner Trees
In the classical vertexweighted Steiner tree problem (VST), one is give...
read it

MultiLevel Steiner Trees
In the classical Steiner tree problem, one is given an undirected, conne...
read it
Faryad Darabi Sahneh
is this you? claim profile