2004
DOI: 10.1007/s00454-004-1121-7
View full text
|
|
Share

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 O(k) and whose total cost is O(k 2 ) times the cost of the minimum spanning tree; these bounds are asymptotically optimal.Our next…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
11
0

Publication Types

Select...

Relationship

0
0

Authors

Journals