On approximating (connected) 2-edge dominating set by a tree (Q1635808)
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: On approximating (connected) 2-edge dominating set by a tree |
scientific article; zbMATH DE number 6879941
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximating (connected) 2-edge dominating set by a tree |
scientific article; zbMATH DE number 6879941 |
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
0 references
0.9168496
0 references
0.91309345
0 references
0.90245485
0 references
0.90234816
0 references
0.8970679
0 references
0.89664173
0 references
0.89653486
0 references
