The wake up dominating set problem

DOI10.1016/J.TCS.2015.01.006zbMATH Open1332.68290OpenAlexW2049231388MaRDI QIDQ5899558FDOQ5899558

Authors: Amir Bannoura, Christian Ortolf, Leonhard Reindl, Christian Schindelhauer 

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.006

Recommendations

• The wake up dominating set problem
• Automata, Languages and Programming
• A better wake-up in radio networks
• Distributed Computing
• The Wake‐Up Problem in MultiHop Radio Networks

zbMATH Keywords

online algorithmconnected dominating setepidemic algorithmsunit-disk graphwake-up receivers

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unit disk graphs
• Planar Formulae and Their Uses
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• Approximation algorithms for connected dominating sets
• PTAS for minimum connected dominating set with routing cost constraint in wireless sensor networks

Cited In (1)

• The wake up dominating set problem

This page was built for publication: The wake up dominating set problem

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