A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A New Infinity of Distance Oracles for Sparse Graphs

2012
*
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
*

Given a weighted undirected graph, our basic goal is to represent all pairwise 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 = O(n) edges. In this paper, for any fixed positive integers k and , we obtain stretches α

doi:10.1109/focs.2012.44
dblp:conf/focs/PatrascuRT12
fatcat:yoqvg43jmvbhfi5gkajgn6cwpm