Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-016-1007-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2290747859 / rank | |||
Normal rank | |||
Revision as of 23:47, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs |
scientific article |
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
