When and Why the Topological Coverage Criterion Works

DOI10.1137/1.9781611974782.177MaRDI QIDQ4575927zbMATH OpenOpenAlexFDO

Authors Nicholas J. Cavanna, Kirk P. Gardner, Donald R. Sheehy

Publication date 16 July 2018

Published in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974782.177

Mathematics Subject Classification ID

Other homology theories in algebraic topology (55N35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The relationship among different covering approximations
• Graph covers: where topology meets computer science, and simple means difficult
• The ideal view on Rackoff's coverability technique
• The ideal view on Rackoff's coverability technique
• scientific article; zbMATH DE number 1774262
• scientific article; zbMATH DE number 5212783
• Bounds for optimal coverings
• Bounds for optimal coverings
• A topological criterion for hypothesis testing

Cited in

(10)

• Coverage in sensor networks via persistent homology
• Relative interleavings and applications to sensor networks
• Coordinate-free coverage in sensor networks with controlled boundaries via homology
• Dynamic coverage verification in mobile sensor networks via switched higher order Laplacians
• Homological sensor networks
• Computing the multicover bifiltration
• Interleaving Mayer-Vietoris spectral sequences
• Computing the multicover bifiltration
• A sparse multicover bifiltration of linear size
• Density sensitive bifiltered Dowker complexes via total weight

This page was built for publication: When and Why the Topological Coverage Criterion Works

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