On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the approximability and hardness of the minimum connected dominating set with routing cost constraint |
scientific article |
Statements
On the approximability and hardness of the minimum connected dominating set with routing cost constraint (English)
0 references
7 October 2019
0 references
20 October 2023
0 references
connected dominating set
0 references
spanner
0 references
set cover with pairs
0 references
MIN-REP problem
0 references
0 references
0 references
0 references
0 references
0 references
