A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687)
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 PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph |
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