Approximating k-Connected m-Dominating Sets (Q5874545)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7651212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating k-Connected m-Dominating Sets |
scientific article; zbMATH DE number 7651212 |
Statements
7 February 2023
0 references
\(k\)-connected graph
0 references
\(m\)-dominating set
0 references
approximation algorithm
0 references
rooted subset \(k\)-connectivity
0 references
subset \(k\)-connectivity
0 references
Approximating k-Connected m-Dominating Sets (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
