Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973)
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: Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs |
scientific article; zbMATH DE number 6644656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs |
scientific article; zbMATH DE number 6644656 |
Statements
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (English)
0 references
27 October 2016
0 references
dominating and absorbing set
0 references
strongly connected
0 references
virtual backbone
0 references
heterogeneous sensor networks
0 references
approximation algorithm
0 references
guaranteed performance
0 references
0 references
0.91132665
0 references
0.91132665
0 references
0.9060868
0 references
0.8964329
0 references
0.8927369
0 references
0.89128536
0 references
0.8890548
0 references
0.8834893
0 references
