A note on max \(k\)-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation (Q6593570)
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 note on max \(k\)-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation |
scientific article; zbMATH DE number 7902018
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on max \(k\)-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation |
scientific article; zbMATH DE number 7902018 |
Statements
A note on max \(k\)-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation (English)
0 references
26 August 2024
0 references
maximum \(k\)-vertex cover
0 references
minimum \(k\)-vertex cover
0 references
approximation algorithms
0 references
fixed-parameter algorithms
0 references
approximate kernelization
0 references
