
TL;DR
This paper constructs a near-optimal weighted additive spanner with a stretch of +6W_max and about O(n^{4/3}) edges, improving previous bounds and extending unweighted spanner techniques to weighted graphs.
Contribution
It provides a construction of a +6W_max weighted additive spanner with near-optimal size, resolving an open problem and extending unweighted spanner methods to weighted graphs.
Findings
Constructed a +6W_max spanner with O(n^{4/3}) edges.
Extended unweighted +6-spanner techniques to weighted graphs.
Developed fast algorithms for constructing +6W_max and +4W_max spanners.
Abstract
Ahmed, Bodwin, Sahneh, Kobourov, and Spence (WG 2020) introduced additive spanners for weighted graphs and constructed (i) a spanner with edges and (ii) a spanner with edges, and (iii) a spanner with edges, for any weighted graph with vertices. Here is the maximum edge weight in the graph. Their results for , , and match the state-of-the-art bounds for the unweighted counterparts where . They left open the question of constructing a spanner with edges. Elkin, Gitlitz, and Neiman (DISC 2021) made significant progress on this problem by showing that there exists a spanner with edges for any fixed constant . Indeed, their result is…
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
TopicsAdvanced Numerical Analysis Techniques · Matrix Theory and Algorithms · Advanced Optimization Algorithms Research
