64 citations · 195 across the 23 of their papers we have counts for
7 papers · 1 filter
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…
Perturbations of CUR Decompositions
Keaton Hamm, Longxiu Huang
The CUR decomposition is a factorization of a low-rank matrix obtained by selecting certain column and row submatrices of it. We perform a thorough investigation of what happens to…
Perspectives on CUR Decompositions
Keaton Hamm, Longxiu Huang
This note discusses an interesting matrix factorization called the CUR Decomposition. We illustrate various viewpoints of this method by comparing and contrasting them in different…
Multi-Level Graph Sketches via Single-Level Solvers
Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli +3
Given an undirected weighted graph , a constrained sketch over a terminal set is a subgraph that connects the terminal vertices while satisfying a given s…
CUR Decompositions, Approximations, and Perturbations
Keaton Hamm, Longxiu Huang
This article discusses a useful tool in dimensionality reduction and low-rank matrix approximation called the CUR decomposition. Various viewpoints of this method in the literature…
Approximation algorithms and an integer program for multi-level graph spanners
Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli +3
Given a weighted graph and , a subgraph is a \emph{--spanner} of if the lengths of shortest paths in are preserved in up to a multiplicative fa…