Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
A local constant approximation factor algorithm for minimum dominating set of certain planar graphs
Alipour, S | 2020
453
Viewed
- Type of Document: Article
- DOI: 10.1145/3350755.3400217
- Publisher: Association for Computing Machinery , 2020
- Abstract:
- In this paper, we present a randomized LOCAL constant approximation factor algorithm for minimum dominating set (MDS) problem and minimum total dominating set (MTDS) problem in graphs. The approximation factor of this algorithm for planar graphs with no 4-cycles is 18 and 9 for MDS and MTDS problems, respectively. © 2020 Owner/Author
- Keywords:
- Approximation algorithm ; Distributed algorithm ; Minimum dominating set ; Planar graph ; Approximation algorithms ; Graph theory ; Graphic methods ; Approximation factor ; Local constants ; Minimum dominating set ; Planar graph ; Total dominating sets ; Graph algorithms
- Source: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2020, 15 July 2020 through 17 July 2020 ; 2020 , Pages 501-502
- URL: https://dl.acm.org/doi/10.1145/3350755.3400217