Approximating edge dominating set in dense graphs (Q764308)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6014301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating edge dominating set in dense graphs |
scientific article; zbMATH DE number 6014301 |
Statements
Approximating edge dominating set in dense graphs (English)
0 references
13 March 2012
0 references
edge dominating set
0 references
minimum maximal matching
0 references
dense instances
0 references
approximation algorithms
0 references
approximation lower bounds
0 references
0 references
0 references
0 references
0 references
0.9903782606124878
0 references
0.8870263695716858
0 references
0.8832781910896301
0 references
0.8807225227355957
0 references
0.8495666980743408
0 references
