Login / Signup
The k-hop connected dominating set problem: hardness and polyhedra.
Rafael S. Coelho
Phablo F. S. Moura
Yoshiko Wakabayashi
Published in:
Electron. Notes Discret. Math. (2015)
Keyphrases
</>
connected dominating set
dominating set
phase transition
special case
facility location problem
np hard
line drawings
np hardness
np complete
extreme points
information theoretic
convex polyhedra
convex hull
linear systems
learning theory