The k-hop connected dominating set problem: approximation and hardness.

Rafael S. Coelho Phablo F. S. Moura Yoshiko Wakabayashi

Published in: J. Comb. Optim. (2017)

Keyphrases

connected dominating set
dominating set
computational complexity
np hard
approximation algorithms
phase transition
approximation error
worst case
error bounds
lower bound
search space
upper bound
agnostic learning