An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923)
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: An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs |
scientific article; zbMATH DE number 6989314
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs |
scientific article; zbMATH DE number 6989314 |
Statements
An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (English)
0 references
5 December 2018
0 references
combinatorial optimization
0 references
vertex cover \(P_3\) problem
0 references
branch-width
0 references
planar graphs
0 references
EPTAS
0 references
0 references
0 references
0 references
0 references
0 references
