Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two algorithms for minimum 2-connected \(r\)-hop dominating set |
scientific article; zbMATH DE number 6802645
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two algorithms for minimum 2-connected \(r\)-hop dominating set |
scientific article; zbMATH DE number 6802645 |
Statements
Two algorithms for minimum 2-connected \(r\)-hop dominating set (English)
0 references
3 November 2017
0 references
approximation algorithms
0 references
wireless sensor network
0 references
\(r\)-hop dominating set
0 references
fault-tolerant
0 references
unit disk graph
0 references
0 references
0 references
