A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks (Q4446911): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Deying Li / rank | |||
| Property / author | |||
| Property / author: Deying Li / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022082910 / rank | |||
Normal rank | |||
Latest revision as of 01:05, 20 March 2024
scientific article; zbMATH DE number 2037561
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks |
scientific article; zbMATH DE number 2037561 |
Statements
A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks (English)
0 references
3 February 2004
0 references
connected dominating set
0 references
unit disk graph
0 references
polynomial-time approximation scheme
0 references
partition
0 references
