A spanner for the day after

DOI10.4230/LIPICS.SOCG.2019.19MaRDI QIDQ5088946FDOQ5088946

Authors: Kevin Buchin, Dániel Oláh, Sariel Har-Peled 

Publication date: 18 July 2022

Recommendations

• A spanner for the day after
• Item:QQ289925
• Item:QQ289925
• Sometimes reliable spanners of almost linear size
• scientific article; zbMATH DE number 2185613

zbMATH Keywords

robustnessgeometric spannersvertex failures

Mathematics Subject Classification ID

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

Cites Work

• Geometric Spanner Networks
• Title not available (Why is that?)
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• New constructions of SSPDs and their applications
• On locality-sensitive orderings and their applications
• Computing the greedy spanner in near-quadratic time
• Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
• Title not available (Why is that?)
• Improved algorithms for constructing fault-tolerant spanners
• Sparse geometric graphs with small dilation
• Title not available (Why is that?)

Cited In (3)

• Sometimes Reliable Spanners of Almost Linear Size.
• Reliable Spanners for Metric Spaces
• On locality-sensitive orderings and their applications

This page was built for publication: A spanner for the day after

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