The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-017-0128-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2600384081 / rank | |||
Normal rank | |||
Revision as of 02:42, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(k\)-hop connected dominating set problem: approximation and hardness |
scientific article |
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
