(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (Q3511366): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximations for Steiner trees with minimum number of Steiner points / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unit disk graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points / rank | |||
Normal rank | |||
Latest revision as of 12:13, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs |
scientific article |
Statements
(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (English)
0 references
10 July 2008
0 references
Unit Disk Graph
0 references
Approximation algorithm
0 references
Dominating Set
0 references
0 references
0 references
