research
∙
01/29/2023
Multi-Priority Graph Sparsification
A sparsification of a given graph G is a sparser graph (typically a subg...
share
research
∙
08/30/2021
Approximation algorithms for priority Steiner tree problems
In the Priority Steiner Tree (PST) problem, we are given an undirected g...
research
∙
08/18/2021
Computing Steiner Trees using Graph Neural Networks
Graph neural networks have been successful in many learning problems and...
research
∙
02/11/2021
Multi-level Weighted Additive Spanners
Given a graph G = (V,E), a subgraph H is an additive +β spanner if _H(u,...
research
∙
02/15/2020
Kruskal-based approximation algorithm for the multi-level Steiner tree problem
We study the multi-level Steiner tree problem: a generalization of the S...
research
∙
02/15/2020
Weighted Additive Spanners
An α-additive spanner of an undirected graph G=(V, E) is a subgraph H su...
research
∙
09/07/2019
Graph Spanners: A Tutorial Review
This tutorial review provides a guiding reference to researchers who wan...
research
∙
05/02/2019
A General Framework for Multi-level Subsetwise Graph Sparsifiers
Given an undirected weighted graph $G(V,E)$, a subsetwise sparsifier ove...
research
∙
04/01/2019
Approximation algorithms and an integer program for multi-level graph spanners
Given a weighted graph G(V,E) and t > 1, a subgraph H is a t--spanner of...
research
∙
11/28/2018
Computing Vertex-Weighted Multi-Level Steiner Trees
In the classical vertex-weighted Steiner tree problem (VST), one is give...
research
∙
04/08/2018
