Reyan Ahmed

activity

20182026

most citedMulti-Level Steiner Trees

9 citations · 9 across the 9 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2025

Online Facility Assignments on Polygons

Sumaiya Malik, Reyan Ahmed, Md. Manzurul Hasan

We study the online facility assignment problem on regular polygons, where all sides are of equal length. The influence of specific geometric settings has remained mostly unexplore…

cs.DS2024

Subsetwise and Multi-Level Additive Spanners with Lightness Guarantees

Reyan Ahmed, Debajyoti Mondal, Rahnuma Islam Nishat

An \emph{additive + $β W$ spanner} of an edge weighted graph $G = (V, E)$ is a subgraph $H$ of $G$ such that for every pair of vertices $u$ and $v$ , $d_{H} (u, v) \leq d_{G} (u, v) + β W$ , wher…

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 $G = (V, E)$ with non-negative edge costs and a set of \emph{terminals} $T \subseteq V$ , the objective is to…