A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847)
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: A (2 - c \frac{\log {n}}{n}) Approximation Algorithm for the Minimum Maximal Matching Problem |
scientific article; zbMATH DE number 5507788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem |
scientific article; zbMATH DE number 5507788 |
Statements
A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (English)
0 references
12 February 2009
0 references
0 references
0 references
0.8831419944763184
0 references
0.8819196820259094
0 references
0.8657894134521484
0 references
0.8057188391685486
0 references
0.8040467500686646
0 references
