New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5842800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs |
scientific article; zbMATH DE number 5842800 |
Statements
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (English)
0 references
28 January 2011
0 references
minimum-weighted dominating set
0 references
minimum-weighted connected dominating set
0 references
minimum-weighted chromatic disk cover
0 references
node-weighted Steiner tree
0 references
polynomial-time approximation scheme
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.9168367981910706
0 references
0.9056624174118042
0 references
0.895402193069458
0 references
0.8902298808097839
0 references
