Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
Liam Roditty, Ariel Sapir

TL;DR
This paper introduces a new family of graph emulators with improved size and stretch properties for weighted and unweighted graphs, generalizing previous constructions and enhancing performance within certain distance regimes.
Contribution
It presents a generalized framework for weighted graph emulators that improves upon existing constructions and extends known results to unweighted graphs with better stretch bounds.
Findings
Constructs emulators with $ ilde O(n^{1+1/k})$ edges for any $k \\in \\mathbb{N}$.
Generalizes and improves upon previous $+2W_1$ and $+4W_1$ emulators by Elkin, Gitlitz, and Neiman.
Achieves better stretch for vertex pairs within distance $O(3^{k^2})$ compared to Thorup and Zwick's emulator.
Abstract
We introduce a generalized family of -emulators with edges, for any , where is the th heaviest edge on a shortest path between two vertices. Our construction generalizes the -spanner of size and the -emulator of size , both by Elkin, Gitlitz and Neiman [DISC'21 and DICO'23]. When is even, these are -emulators and when is odd, these are -emulators. Our framework not only…
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.
