paper

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)

arXiv:2304.04445

Abstract

Given an -vertex undirected graph , and a parameter , a path-reporting distance oracle (or PRDO) is a data structure of size , that given a query , returns an -approximate shortest path in within time . Here , and are arbitrary functions. A landmark PRDO due to Thorup and Zwick, with an improvement of Wulff-Nilsen, has , and . The size of this oracle is for all . Elkin and Pettie and Neiman and Shabat devised much sparser PRDOs, but their stretch was polynomially larger than the optimal . On the other hand, for non-path-reporting distance oracles, Chechik devised a result with , and . In this paper we make a dramatic progress in bridging the gap between path-reporting and non-path-reporting distance oracles. We devise a PRDO with size , stretch and query time . We can also have size , stretch and query time . Our results on PRDOs are based on novel constructions of approximate distance preservers, that we devise in this paper. Specifically, we show that for any , any , and any graph and a collection of vertex pairs, there exists a -approximate preserver with edges, where . These new preservers are significantly sparser than the previous state-of-the-art approximate preservers due to Kogan and Parter.

69 pages, 4 figures

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n) · wovepaper