Fault-tolerant geometric spanners

Document Type

Conference Proceeding

Publication Date

1-1-2003

Abstract

We present two new results about vertex and edge fault-tolerant spanners in Euclidean spaces. We describe the first construction of vertex and edge fault-tolerant spanners having optimal bounds for maximum degree and total cost. We present a greedy algorithm that for any t > 1 and any non-negative integer k, constructs a k-fault-tolerant t-spanner in which every vertex is of degree script O sign(k) and whose total cost is script O sign(k2) times the cost of minimum spanning tree; these bounds are asymptotically optimal. Our next contribution is an efficient algorithm for constructing good fault-tolerant spanners. We present a new, sufficient condition for a graph to be a k-fault-tolerant spanner. Using this condition, we design an efficient algorithm that finds fault-tolerant spanners with asymptotically optimal bound for the maximum degree and almost optimal bounds for the total cost.

Identifier

0038714891 (Scopus)

Publication Title

Proceedings of the Annual Symposium on Computational Geometry

External Full Text Location

https://doi.org/10.1145/777792.777794

First Page

1

Last Page

10

This document is currently not available here.

Share

COinS