PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs (Q2392763)
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 the minimum k-path connected vertex cover problem in unit disk graphs |
scientific article; zbMATH DE number 6194386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs |
scientific article; zbMATH DE number 6194386 |
Statements
PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs (English)
0 references
2 August 2013
0 references
PTAS
0 references
\(k\)-path connected vertex cover
0 references
unit disk graph
0 references
0 references
0.9081010818481444
0 references
0.8589455485343933
0 references
0.8502251505851746
0 references
0.840898334980011
0 references
0.8404566049575806
0 references
