Near-Linear Time Construction of Sparse Neighborhood Covers

This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time) for any problem whose solution relies on network decompositions, including small edge cuts in planar graphs, approximate shortest paths, and weight- and distance-preserving graph spanners. In particular, an O(log n) approximation to the k-shortest paths problem on an n-vertex, E-edge graph is obtained that runs in $\soh{n + E + k}$ time.

[1]  Baruch Awerbuch,et al.  Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[2]  Yehuda Afek,et al.  Sparser: A Paradigm for Running Distributed Algorithms , 1992, J. Algorithms.

[3]  Michael E. Saks,et al.  Decomposing graphs into regions of small diameter , 1991, SODA '91.

[4]  Mihalis Yannakakis,et al.  High-probability parallel transitive closure algorithms , 1990, SPAA '90.

[5]  Satish Rao.  Faster algorithms for finding small edge cuts in planar graphs , 1992, STOC '92.

[6]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[7]  David R. Karger,et al.  Finding the hidden path: time bounds for all-pairs shortest paths , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[8]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[9]  Noga Alon,et al.  Witnesses for Boolean matrix multiplication and for shortest paths , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[10]  Harold N. Gabow,et al.  Scaling algorithms for network problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Raimund Seidel,et al.  On the all-pairs-shortest-path problem , 1992, STOC '92.

[12]  Noga Alon,et al.  On the Exponent of the All Pairs Shortest Path Problem , 1991, J. Comput. Syst. Sci..

[13]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[14]  Peter A. Bloniarz.  A Shortest-Path Algorithm with Expected Time O(n2 log n log* n) , 1983, SIAM J. Comput..

[15]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[16]  Philip N. Klein,et al.  A parallel randomized approximation scheme for shortest paths , 1992, STOC '92.

[17]  Giri Narasimhan,et al.  Fast algorithms for constructing t-spanners and paths with stretch t , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[18]  Giri Narasimhan,et al.  New sparseness results on graph spanners , 1992, SCG '92.

[19]  Philip M. Spira,et al.  A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n) , 1973, SIAM J. Comput..

[20]  Håkan Jakobsson,et al.  Mixed-approach algorithms for transitive closure (extended abstract) , 1991, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.