The price of connectivity for dominating set: Upper bounds and complexity.

Eglantine Camby Oliver Schaudt

Published in: Discret. Appl. Math. (2014)

Keyphrases

upper bound
dominating set
worst case
lower bound
facility location problem
search algorithm
evolutionary algorithm
np hard
connected components
branch and bound
branch and bound algorithm
sample complexity
lower and upper bounds
upper and lower bounds
computational complexity
sample size