2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (2012)

New Brunswick, NJ, USA USA

Oct. 20, 2012 to Oct. 23, 2012

ISSN: 0272-5428

ISBN: 978-1-4673-4383-1

pp: 738-747

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2012.44

ABSTRACT

Given a weighted undirected graph, our basic goal is to represent all pair wise distances using much less than quadratic space, such that we can estimate the distance between query vertices in constant time. We will study the inherent trade-off between space of the representation and the stretch (multiplicative approximation disallowing underestimates) of the estimates when the input graph is sparse with $m=\wt O(n)$ edges. In this paper, for any fixed positive integers $k$ and $\ell$, we obtain stretches $\alpha=2k+1\pm\frac{2}{\ell}= 2k+1-\frac{2}{\ell}, 2k+1+\frac{2}{\ell}$, using space $S(\alpha, m) = \wt O(m^{1+2/(\alpha+1)})$. The query time is $O(k+\ell)=O(1)$. For integer stretches, this coincides with the previous bounds (odd stretches with $\ell=1$ and even stretches with $\ell=2$). The infinity of fractional stretches between consecutive integers are all new (even though $\ell$ is fixed as a constant independent of the input, the number of integers $\ell$ is still countably infinite). % We will argue that the new fractional points are not just arbitrary, but that they, at least for fixed stretches below $3$, provide a complete picture of the inherent trade-off between stretch and space in $m$. Consider any fixed stretch $\alpha

INDEX TERMS

distances, sparse graphs, distance oracles, shortest paths

CITATION

M. Patrascu, L. Roditty and M. Thorup, "A New Infinity of Distance Oracles for Sparse Graphs,"

*2012 IEEE 53rd Annual Symposium on Foundations of Computer Science(FOCS)*, New Brunswick, NJ, USA USA, 2012, pp. 738-747.

doi:10.1109/FOCS.2012.44

CITATIONS