On the power of lookahead in greedy scheme for finding a minimum CDS for unit disk graphs (Q2970204)
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: On the power of lookahead in greedy scheme for finding a minimum CDS for unit disk graphs |
scientific article; zbMATH DE number 6697876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the power of lookahead in greedy scheme for finding a minimum CDS for unit disk graphs |
scientific article; zbMATH DE number 6697876 |
Statements
On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs (English)
0 references
28 March 2017
0 references
connected dominating set
0 references
unit disk graph
0 references
greedy algorithm
0 references
performance ratio
0 references
0 references
0 references
0.8200410604476929
0 references
0.8083677291870117
0 references
0.8029416799545288
0 references
0.8019413948059082
0 references
0.7985603213310242
0 references
