A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (Q2445394)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6284423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs |
scientific article; zbMATH DE number 6284423 |
Statements
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs (English)
0 references
14 April 2014
0 references
approximation algorithms
0 references
distributed algorithm
0 references
local algorithm
0 references
dominating set
0 references
planar graph
0 references
0.8705952167510986
0 references
0.8704861402511597
0 references
0.8387237191200256
0 references
0.8243499398231506
0 references
0.818517804145813
0 references
