Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605)
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: Improved approximation algorithms for k-connected m-dominating set problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems |
scientific article |
Statements
Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (English)
0 references
19 October 2018
0 references
\(k\)-connected graph
0 references
\(m\)-dominating set
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.9622219204902648
0 references
0.9050225615501404
0 references
0.8821637034416199
0 references
0.8771796226501465
0 references
0.8449584245681763
0 references
