A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (Q724732)
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: A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network |
scientific article; zbMATH DE number 6910540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network |
scientific article; zbMATH DE number 6910540 |
Statements
A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network (English)
0 references
26 July 2018
0 references
connected \(k\)-path vertex cover
0 references
unit disk graph
0 references
PTAS
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0.9012612
0 references
0.88495016
0 references
0.87500334
0 references
0.8639171
0 references
0.85831535
0 references
0.8562912
0 references
