Login / Signup

The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs.

Xianliang LiuWei WangDonghyun KimZishen YangAlade O. TokutaYaolin Jiang
Published in: Wirel. Networks (2016)
Keyphrases
  • connected dominating set
  • dominating set
  • constant factor approximation
  • facility location problem
  • approximation algorithms
  • np hard
  • worst case
  • search algorithm
  • closest string