Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: Q4551389 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for connected dominating sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A greedy approximation for minimum connected dominating sets / rank | |||
Normal rank | |||
Revision as of 19:51, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving construction for connected dominating set with Steiner tree in wireless sensor networks |
scientific article |
Statements
Improving construction for connected dominating set with Steiner tree in wireless sensor networks (English)
0 references
26 September 2006
0 references
0 references
