Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bypassing Erdős' Girth Conjecture: Hybrid Stretch and Sourcewise Spanners

Published 27 Apr 2014 in cs.DS | (1404.6835v1)

Abstract: An (α,β)(\alpha,\beta)-spanner of an nn-vertex graph G=(V,E)G=(V,E) is a subgraph HH of GG satisfying that dist(u,v,H)≤α⋅dist(u,v,G)+βdist(u, v, H) \leq \alpha \cdot dist(u, v, G)+\beta for every pair (u,v)∈V×V(u, v)\in V \times V, where dist(u,v,G′)dist(u,v,G') denotes the distance between uu and vv in G′⊆GG' \subseteq G. It is known that for every integer k≥1k \geq 1, every graph GG has a polynomially constructible (2k−1,0)(2k-1,0)-spanner of size O(n1+1/k)O(n^{1+1/k}). This size-stretch bound is essentially optimal by the girth conjecture. It is therefore intriguing to ask if one can "bypass" the conjecture by settling for a multiplicative stretch of $2k-1$ only for \emph{neighboring} vertex pairs, while maintaining a strictly \emph{better} multiplicative stretch for the rest of the pairs. We answer this question in the affirmative and introduce the notion of \emph{kk-hybrid spanners}, in which non neighboring vertex pairs enjoy a \emph{multiplicative} kk-stretch and the neighboring vertex pairs enjoy a \emph{multiplicative} (2k−1)(2k-1) stretch (hence, tight by the conjecture). We show that for every unweighted nn-vertex graph GG with mm edges, there is a (polynomially constructible) kk-hybrid spanner with O(k2⋅n1+1/k)O(k^2 \cdot n^{1+1/k}) edges. \indent An alternative natural approach to bypass the girth conjecture is to allow ourself to take care only of a subset of pairs S×VS \times V for a given subset of vertices S⊆VS \subseteq V referred to here as \emph{sources}. Spanners in which the distances in S×VS \times V are bounded are referred to as \emph{sourcewise spanners}. Several constructions for this variant are provided (e.g., multiplicative sourcewise spanners, additive sourcewise spanners and more).

Authors (1)
Citations (28)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.