Abstract
In this paper we present an algorithm for maintaining a spanner over a dynamic set of points in constant doubling dimension metric spaces. For a set S of points in ℝ d , a t-spanner is a sparse graph on the points of S such that there is a path in the spanner between any pair of points whose total length is at most t times the distance between the points. We present the first fully dynamic algorithm for maintaining a spanner whose update time depends solely on the number of points in S. In particular, we show how to maintain a (1+e)-spanner with O(n/e d ) edges, where points can be inserted to S in an amortized update time of O(log n) and deleted from S in an amortized update time of $\tilde{O}(n^{1/3})$. As a by-product of our techniques we obtain a simple incremental algorithm for constructing a (1+e)-spanner with O(n/e d ) edges in constant doubling dimension metric spaces whose running time is O(nlog n).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
