Approximation hardness of edge dominating set problems (Q2369972)
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: Approximation hardness of edge dominating set problems |
scientific article; zbMATH DE number 5166294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation hardness of edge dominating set problems |
scientific article; zbMATH DE number 5166294 |
Statements
Approximation hardness of edge dominating set problems (English)
0 references
21 June 2007
0 references
minimum edge dominating set
0 references
minimum maximal matching
0 references
approximation lower bound
0 references
bounded degree graphs
0 references
everywhere dense graphs
0 references
0 references
0.9751929640769958
0 references
0.9000013470649719
0 references
0.8955225348472595
0 references
0.8807225227355957
0 references
0.8758816123008728
0 references
