A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-1-4614-5131-0_9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W84359630 / rank | |||
Normal rank | |||
Revision as of 00:22, 20 March 2024
scientific article; zbMATH DE number 6420860
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph |
scientific article; zbMATH DE number 6420860 |
Statements
A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (English)
0 references
30 March 2015
0 references
connected dominating set
0 references
unit disk graph
0 references
PTAS
0 references
