A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion (Q6612520)
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 simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion |
scientific article; zbMATH DE number 7920437
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion |
scientific article; zbMATH DE number 7920437 |
Statements
A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion (English)
0 references
30 September 2024
0 references
split graph
0 references
