Keaton Hamm

activity

20182021

most citedComputing Steiner Trees using Graph Neural Networks

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing cs.DMShow all

5 papers · 1 filter

cs.DM2021

Multi-level Weighted Additive Spanners

Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh +3

Given a graph $G = (V, E)$ , a subgraph $H$ is an \emph{additive $+ β$ spanner} if $\dist_H(u,v) \le \dist_G(u,v) + β$ for all $u, v \in V$ . A \emph{pairwise spanner} is a spanner for…

cs.DM2021

On additive spanners in weighted graphs with local error

Reyan Ahmed, Greg Bodwin, Keaton Hamm +2

An \emph{additive $+ β$ spanner} of a graph $G$ is a subgraph which preserves distances up to an additive $+ β$ error. Additive spanners are well-studied in unweighted graphs but hav…

cs.DM2019

Graph Spanners: A Tutorial Review

Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh +4

This tutorial review provides a guiding reference to researchers who want to have an overview of the large body of literature about graph spanners. It reviews the current literatur…

cs.DM2019

Multi-Level Graph Sketches via Single-Level Solvers

Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli +3

Given an undirected weighted graph $G (V, E)$ , a constrained sketch over a terminal set $T \subset V$ is a subgraph $G^{'}$ that connects the terminal vertices while satisfying a given s…

cs.DM2019

Approximation algorithms and an integer program for multi-level graph spanners

Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli +3

Given a weighted graph $G (V, E)$ and $t \geq 1$ , a subgraph $H$ is a \emph{ $t$ --spanner} of $G$ if the lengths of shortest paths in $G$ are preserved in $H$ up to a multiplicative fa…