Login / Signup
A polynomial-time approximation to a minimum dominating set in a graph.
Frank Angel Hernández Mira
Ernesto Parra Inza
José M. Sigarreta Almira
Nodari Vakhania
Published in:
Theor. Comput. Sci. (2022)
Keyphrases
</>
dominating set
connected dominating set
polynomial time approximation
facility location problem
approximation algorithms
np hard
error bounds
facility location
special case
minimum cost
search algorithm
approximation ratio
constant factor