A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks

DOI10.1007/978-3-642-45346-5_16zbMath1397.68145OpenAlexW1443029575MaRDI QIDQ1796438

Michael Schubert, Friedhelm Meyer auf der Heide, Christine Markarian

Publication date: 17 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-642-45346-5_16

zbMATH Keywords

dominating setdistributed algorithmsvirtual backbonead-hoc networksabsorbent set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (1)

Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks

This page was built for publication: A distributed approximation algorithm for strongly connected dominating-absorbent sets in asymmetric wireless ad-hoc networks