On approximating (connected) 2-edge dominating set by a tree (Q1635808): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00224-017-9764-y / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00224-017-9764-Y / rank | |||
Normal rank | |||
Latest revision as of 23:55, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximating (connected) 2-edge dominating set by a tree |
scientific article |
Statements
On approximating (connected) 2-edge dominating set by a tree (English)
0 references
1 June 2018
0 references
edge dominating sets
0 references
approximation algorithms
0 references
tree cover
0 references
connected dominating sets
0 references
\(b\)-edge domination
0 references
0 references
0 references
0 references
