Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_24 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1890004479 / rank | |||
Normal rank | |||
Revision as of 18:22, 19 March 2024
scientific article; zbMATH DE number 5498461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph |
scientific article; zbMATH DE number 5498461 |
Statements
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (English)
0 references
27 January 2009
0 references
connected vertex cover
0 references
unit disk graph
0 references
