TY - JOUR
T1 - Near-Linear Time Construction of Sparse Neighborhood Covers
AU - Awerbuch, Baruch
AU - Berger, Bonnie
AU - Cowen, Lenore
AU - Peleg, David
PY - 1998
Y1 - 1998
N2 - 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 O (n + E + k) time.
AB - 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 O (n + E + k) time.
KW - Approximate shortest paths
KW - Neighborhood covers
KW - Network decompositions
KW - Spanners
UR - http://www.scopus.com/inward/record.url?scp=0032057919&partnerID=8YFLogxK
U2 - 10.1137/S0097539794271898
DO - 10.1137/S0097539794271898
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0032057919
SN - 0097-5397
VL - 28
SP - 263
EP - 277
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 1
ER -