Computing minimum k-connected m-fold dominating set in general graphs
| Year of publication: |
2018
|
|---|---|
| Authors: | Zhang, Zhao ; Zhou, Jiao ; Tang, Shaojie ; Huang, Xiaohui ; Du, Dingzhu |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 2, p. 217-224
|
| Subject: | wireless sensor network | connected dominating set | fault tolerance | approximation algorithm | Graphentheorie | Graph theory | Algorithmus | Algorithm | Computernetz | Computer network | Mobile Anwendung | Mobile application |
-
Debnath, Arindam, (2019)
-
Investigating of antenna selection for the adaptive centroid localization systems
Yuangyai, Chumpol, (2015)
-
Devi, E. Anna, (2020)
- More ...
-
Zhou, Jiao, (2018)
-
A new approximation algorithm for minimum-weight (1,m)–connected dominating set
Zhou, Jiao, (2025)
-
Breaking the r max barrier : enhanced approximation algorithms for partial set multicover problem
Ran, Yingli, (2021)
- More ...