Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559)
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 algorithms for the maximum vertex coverage problem on bounded degree graphs |
scientific article; zbMATH DE number 7401219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs |
scientific article; zbMATH DE number 7401219 |
Statements
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (English)
0 references
27 September 2021
0 references
cubic graph
0 references
maximum vertex coverage
0 references
approximation
0 references
0 references
0.8625138401985168
0 references
0.8466869592666626
0 references
0.798149824142456
0 references
0.7956476807594299
0 references
