Approximating \(k\)-connected \(m\)-dominating sets (Q2144267)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating k-connected m-dominating sets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating \(k\)-connected \(m\)-dominating sets |
scientific article |
Statements
Approximating \(k\)-connected \(m\)-dominating sets (English)
0 references
1 June 2022
0 references
The paper deals with a wealth of graph-theoretic algorithms, their mutual relations and gradual improvements of complexity estimations, providing 25 references to the literature. It may not be without practical relevance when supporting different aspects of network reliability; it will be interesting mainly for specialists in estimating such complexities.
0 references
\(k\)-connected graph
0 references
\(m\)-dominating set
0 references
subset \(k\)-connectivity
0 references
approximation algorithms
0 references
0 references
0 references
0 references
1.0000002
0 references
0.9517456
0 references
0.9517456
0 references
0.95036155
0 references
0.9388684
0 references
0.9303785
0 references
0.9303785
0 references
0.9267522
0 references
0.9261429
0 references
