IEEE Conference on Computer Communications, INFOCOM 2015


Article Details
Title: A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition
Article URLs:
Alternative Article URLs:
Authors: Wei Wang
  • Xi’an Jiaotong University, Xi’an, China, School of Mathematics and Statistics
Bei Liu
  • Xi’an Jiaotong University, Xi’an, China, School of Mathematics and Statistics
Donghyun Kim
  • North Carolina Central University, Durham, USA, Department of Mathematics and Physics
Deying Li
  • Renmin University of China, Beijing, P.R. China, Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University)
  • Renmin University of China, Beijing, P.R. China, MOE School of Information
Jingyi Wang
  • Xi’an Jiaotong University, Xi’an, China, School of Mathematics and Statistics
Yaolin Jiang
  • Xi’an Jiaotong University, Xi’an, China, School of Mathematics and Statistics
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1345219
DBLP Key: conf/infocom/0032LKLWJ15
Author Comments:

Discuss this paper and its artifacts below