Near-Additive Spanners and Near-Exact Hopsets, A Unified View
Abstract
Given an unweighted undirected graph G = (V,E), and a pair of parameters ε > 0, β = 1,2,…, a subgraph G' =(V,H), H ⊂eq E, of G is a (1+ε,β)-spanner (aka, a near-additive spanner) of G if for every u,v ∈ V, dG'(u,v) (1+ε)dG(u,v) + β~. It was shown in EP01 that for any n-vertex G as above, and any ε > 0 and = 1,2,…, there exists a (1+ε,β)-spanner G' with Oε,(n1+1/) edges, with β = βEP = ( ε) - 2~. This bound remains state-of-the-art, and its dependence on ε (for the case of small ) was shown to be tight in ABP18. Given a weighted undirected graph G = (V,E,ω), and a pair of parameters ε > 0, β = 1,2,…, a graph G'= (V,H,ω') is a (1+ε,β)-hopset (aka, a near-exact hopset) of G if for every u,v ∈ V, dG(u,v) dG G'(β)(u,v) (1+ε)dG(u,v)~, where dG G'(β)(u,v) stands for a β-(hop)-bounded distance between u and v in the union graph G G'. It was shown in EN16 that for any n-vertex G and ε and as above, there exists a (1+ε,β)-hopset with O(n1+1/) edges, with β = βEP. Not only the two results of EP01 and EN16 are strikingly similar, but so are also their proof techniques. Moreover, Thorup-Zwick's later construction of near-additive spanners TZ06 was also shown in EN19,HP17 to provide hopsets with analogous (to that of TZ06) properties. In this survey we explore this intriguing phenomenon, sketch the basic proof techniques used for these results, and highlight open questions.