This survey provides a guiding reference to researchers seeking an overview of the large
body of literature about graph spanners. It surveys the current literature covering various …

A key performance metric in blockchains is the latency between when a transaction is
broadcast and when it is confirmed (the so-called, confirmation latency). While …

We study the problem of constructing ε-coresets for the (k, z)-clustering problem in a
doubling metric M (X, d). An ε-coreset is a weighted subset S⊆ X with weight function w: S→ …

We study the problem of routing in doubling metrics and show how to perform hierarchical
routing in such metrics with small stretch and compact routing tables (ie, with a small amount …

The greedy spanner is arguably the simplest and most well-studied spanner construction.
Experimental results demonstrate that it is at least as good as any other spanner …

It has long been known that d-dimensional Euclidean point sets admit (1+ ε)-stretch
spanners with lightness WE= ε-O (d), that is the total edge weight is at most WE times the …

This paper presents the first distributed algorithm to construct a spanner for arbitrary ad hoc
networks under the physical signal-to-interference-and-noise-ratio (SINR) interference …

In 2016, a breakthrough result of Chechik and Wulff-Nilsen [SODA'16] established that every
𝑛-node graph 𝐺 has a (1+ 𝜀)(2𝑘− 1)-spanner of lightness 𝑂𝜀 (𝑛 1/𝑘), and recent followup …

Mining in proof-of-work blockchains has become an expensive affair requiring specialized
hardware capable of executing several megahashes per second at huge electricity costs …

For any constant d and parameter ε∈(0,1/2, we show the existence of (roughly) 1/ε^d
orderings on the unit cube 0,1)^d such that for any two points p,q∈0,1)^d close together …