Abstract
Given an {\em unweighted} undirected graph , and a pair of parameters , , a subgraph , , of is a {\em -spanner} (aka, a {\em near-additive spanner}) of if for every , It was shown in \cite{EP01} that for any -vertex as above, and any and , there exists a -spanner with edges, with This bound remains state-of-the-art, and its dependence on (for the case of small ) was shown to be tight in \cite{ABP18}. Given a {\em weighted} undirected graph , and a pair of parameters , , a graph is a {\em -hopset} (aka, a {\em near-exact hopset}) of if for every , where stands for a -(hop)-bounded distance between and in the union graph . It was shown in \cite{EN16} that for any -vertex and and as above, there exists a -hopset with edges, with . Not only the two results of \cite{EP01} and \cite{EN16} are strikingly similar, but so are also their proof techniques. Moreover, Thorup-Zwick's later construction of near-additive spanners \cite{TZ06} was also shown in \cite{EN19,HP17} to provide hopsets with analogous (to that of \cite{TZ06}) properties. In this survey we explore this intriguing phenomenon, sketch the basic proof techniques used for these results, and highlight open questions.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.