EventsThe 1st Online Conference on Algorithms
Event submissions
Published
with-doi10.3390/IOCA2021-10895 (registering DOI)
This submission belongs to the session B. Combinatorial Optimization, Graph and Network Algorithms of the event The 1st Online Conference on Algorithms
Published date
25 Sep, 2021
Academic Editor
author-avatarFrank Werner
Citation
Frank Angel Hernández Mira, Ernesto Parra Inza, Jose María Sigarreta Almira, Nodari Vakhania, A polynomial-time approximation to a minimum dominating set in a graph, in Proceedings of The 1st Online Conference on Algorithms, 27 September–10 October 2021, MDPI: Basel, Switzerland, doi: 10.3390/IOCA2021-10895
Share
Email
Facebook
Twitter
LinkedIn

A polynomial-time approximation to a minimum dominating set in a graph

Frank Angel Hernández Mira 1
Ernesto Parra Inza 1
image
Jose María Sigarreta Almira 1
Nodari Vakhania 2
1. UAGro
2. UAEM
Abstract
Keywords
graph
dominating set
approximation ratio
approximation algorithm
time complexity
Manuscript
IOCA-2021 (A polynomial-time approximation).pdf