Improved algorithms for constructing fault-tolerant spanners

DOI10.1007/s00453-001-0075-xzbMath0998.68226OpenAlexW1869076784MaRDI QIDQ5956838

Giri Narasimhan, Michiel H. M. Smid, Christos Levcopoulos

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

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

Related Items (13)

\( \delta \)-greedy \(t\)-spanner ⋮ Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ Reliable Spanners for Metric Spaces ⋮ Continuous Yao graphs ⋮ Minimum weight Euclidean \((1+\varepsilon)\)-spanners ⋮ Vertex Fault-Tolerant Geometric Spanners for Weighted Points ⋮ A spanner for the day after ⋮ Sometimes Reliable Spanners of Almost Linear Size. ⋮ Unnamed Item ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies ⋮ Deformable spanners and applications ⋮ Vertex fault-tolerant spanners for weighted points in polygonal domains ⋮ Region-fault tolerant geometric spanners

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