PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1717956 |
Changed an Item |
||
| Property / author | |||
| Property / author: Xiao-hui Huang / rank | |||
Normal rank | |||
Revision as of 07:31, 29 February 2024
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
