Improved approximation bounds for edge dominating set in dense graphs (Q1006077)
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 5529521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation bounds for edge dominating set in dense graphs |
scientific article; zbMATH DE number 5529521 |
Statements
Improved approximation bounds for edge dominating set in dense graphs (English)
0 references
17 March 2009
0 references
edge dominating set
0 references
minimum maximal matching
0 references
approximation algorithm
0 references
dense graph
0 references
greedy algorithm
0 references
0 references
0 references
0.9965780973434448
0 references
0.8870263695716858
0 references
0.8798191547393799
0 references
0.8409191966056824
0 references
0.8286304473876953
0 references
