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

Frank Hernandez Ernesto Parra José María Sigarreta Nodari Vakhania

Published in: CoRR (2022)

Keyphrases

dominating set
connected dominating set
polynomial time approximation
facility location problem
approximation algorithms
np hard
special case
error bounds
facility location
worst case
constant factor
theoretical analysis
mathematical model
dynamic systems
minimum cost