Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744)
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 algorithms for highly connected multi-dominating sets in unit disk graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for highly connected multi-dominating sets in unit disk graphs |
scientific article |
Statements
Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (English)
0 references
11 January 2019
0 references
connected dominating set
0 references
unit disk graph
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.9050225615501404
0 references
0.8926432132720947
0 references
0.8923092484474182
0 references
0.8634846210479736
0 references
