Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013)
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 algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs |
scientific article; zbMATH DE number 7927448
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs |
scientific article; zbMATH DE number 7927448 |
Statements
Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (English)
0 references
16 October 2024
0 references
connected-\(k\)-subgraph cover
0 references
approximation algorithm
0 references
local search
0 references
minor-free graph
0 references
PTAS
0 references
FPT
0 references
0 references
0 references
