A greedy approximation for minimum connected dominating sets (Q706637): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: `` Strong '' NP-Completeness Results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for connected dominating sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank | |||
Normal rank | |||
Latest revision as of 16:55, 7 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A greedy approximation for minimum connected dominating sets |
scientific article |
Statements
A greedy approximation for minimum connected dominating sets (English)
0 references
9 February 2005
0 references
Connected dominating set
0 references
greedy approximation
0 references
0 references
