Near-Additive Spanners and Near-Exact Hopsets, A Unified View
Michael Elkin, Ofer Neiman

TL;DR
This paper unifies the study of near-additive spanners and near-exact hopsets, revealing their similar properties, proof techniques, and open questions in graph approximation.
Contribution
It provides a unified view of near-additive spanners and hopsets, analyzing their similarities, proof methods, and open problems in graph approximation.
Findings
Near-additive spanners and hopsets have similar size and stretch properties.
Proof techniques for both structures are closely related.
Open questions remain about optimal bounds and constructions.
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 , $\beta =…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Limits and Structures in Graph Theory
