A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117)
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 local approximation algorithm for minimum dominating set problem in anonymous planar networks |
scientific article; zbMATH DE number 6496239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A local approximation algorithm for minimum dominating set problem in anonymous planar networks |
scientific article; zbMATH DE number 6496239 |
Statements
A local approximation algorithm for minimum dominating set problem in anonymous planar networks (English)
0 references
20 October 2015
0 references
approximation
0 references
local algorithm
0 references
dominating set
0 references
planar graph
0 references
0.8865251541137695
0 references
0.8655542135238647
0 references
