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 |
-
SinkRank : an algorithm for identifying systemically important banks in payment systems
Soramäki, Kimmo, (2013)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Thevenin, Simon, (2017)
- More ...
-
Zhou, Jiao, (2018)
-
Breaking the r max barrier : enhanced approximation algorithms for partial set multicover problem
Ran, Yingli, (2021)
-
Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio
Zhang, Yaoyao, (2024)
- More ...