Zihan Tan

activity

20142023

most citedRobust Influence Maximization

12 citations · 20 across the 13 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Parallel Greedy Spanners

Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan

A $t$ -spanner of a graph is a subgraph that $t$ -approximates pairwise distances. The greedy algorithm is one of the simplest and most well-studied algorithms for constructing a spa…

cs.DS2023

Almost-Optimal Sublinear Additive Spanners

Zihan Tan, Tianyi Zhang

Given an undirected unweighted graph $G = (V, E)$ on $n$ vertices and $m$ edges, a subgraph $H \subseteq G$ is a spanner of $G$ with stretch function $f: \mathbb{R}_+ \rightarrow \m…