PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122)
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: PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs |
scientific article; zbMATH DE number 6851663
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs |
scientific article; zbMATH DE number 6851663 |
Statements
PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (English)
0 references
21 March 2018
0 references
node deletion problem
0 references
maximum subgraph problem
0 references
\(k\)-path vertex cover
0 references
degree-bounded node deletion
0 references
connected \(k\)-subgraph cover
0 references
disk graph
0 references
PTAS
0 references
local search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8673024
0 references
0.8609138
0 references
0 references
0.84878385
0 references
0.84840393
0 references
0.84588796
0 references
0.8448514
0 references
0.84380805
0 references
0.84204286
0 references
