On the approximability of the maximum induced matching problem (Q1775017)
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 the approximability of the maximum induced matching problem |
scientific article; zbMATH DE number 2165395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the approximability of the maximum induced matching problem |
scientific article; zbMATH DE number 2165395 |
Statements
On the approximability of the maximum induced matching problem (English)
0 references
4 May 2005
0 references
Induced matching
0 references
Strong matching
0 references
Regular graph
0 references
Approximation algorithm
0 references
APX-completeness
0 references
0 references
0.9384562
0 references
0 references
0 references
0.93287086
0 references
0.9300169
0 references
0.9289345
0 references
0 references
0.92146915
0 references
