The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503)
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: The k-hop connected dominating set problem: approximation and hardness |
scientific article; zbMATH DE number 6804416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(k\)-hop connected dominating set problem: approximation and hardness |
scientific article; zbMATH DE number 6804416 |
Statements
The \(k\)-hop connected dominating set problem: approximation and hardness (English)
0 references
9 November 2017
0 references
approximation algorithms
0 references
hardness
0 references
\(k\)-hop connected dominating set
0 references
\(k\)-disruptive separator
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9554427266120912
0 references
0.8332687020301819
0 references
0.8298568725585938
0 references
0.8216560482978821
0 references
0.8074811697006226
0 references
