New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:15, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs |
scientific article |
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
