Login / Signup
A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition.
Wei Wang
Bei Liu
Donghyun Kim
Deying Li
Jingyi Wang
Yaolin Jiang
Published in:
INFOCOM (2015)
Keyphrases
</>
dominating set
connected dominating set
facility location problem
approximation algorithms
constant factor
evolutionary algorithm
upper bound
worst case
connected components
decomposition method
facility location
neural network
np hard
simulated annealing
minimum cost
structural learning