PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs |
scientific article |
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
