Improved algorithms for constructing fault-tolerant spanners

DOI10.1007/S00453-001-0075-XMaRDI QIDQ5956838zbMATH OpenOpenAlexFDO

Authors Christos Levcopoulos, Giri Narasimhan, Michiel Smid

Publication date 20 May 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0075-x

zbMATH Keywords

fault-tolerancespanners

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1775403
• Fault-tolerant geometric spanners
• Fault-tolerant geometric spanners
• scientific article; zbMATH DE number 2185613
• Fault tolerant spanners for general graphs

Cited in

(22)

• Region-fault tolerant geometric spanners
• Continuous Yao graphs
• A spanner for the day after
• Deformable spanners and applications
• Fault-tolerant spanners
• scientific article; zbMATH DE number 1775403 (Why is no real title available?)
• A spanner for the day after
• A Trivial Yet Optimal Solution to Vertex Fault Tolerant Spanners
• From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics
• Fault-tolerant geometric spanners
• Efficient and Simple Algorithms for Fault-Tolerant Spanners
• Sometimes Reliable Spanners of Almost Linear Size.
• Minimum weight Euclidean (1+)-spanners
• Reliable Spanners for Metric Spaces
• Vertex Fault-Tolerant Geometric Spanners for Weighted Points
• Vertex fault-tolerant spanners for weighted points in polygonal domains
• Minimum weight Euclidean \((1+\varepsilon)\)-spanners
• Local spanners revisited
• Reliable spanners for metric spaces
• Fault tolerant max-cut
• \( \delta \)-greedy \(t\)-spanner
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

This page was built for publication: Improved algorithms for constructing fault-tolerant spanners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956838)