A new approximation algorithm for minimum-weight (1,m)–connected dominating set
| Year of publication: |
2025
|
|---|---|
| Authors: | Zhou, Jiao ; Ran, Yingli ; Pardalos, Panos M. ; Zhang, Zhao ; Tang, Shaojie ; Du, Dingzhu |
| Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 37.2025, 4, p. 1106-1120
|
| Subject: | approximation algorithm | connected dominating set | fault-tolerance | weight |
-
Zhou, Jiao, (2018)
-
Computing minimum k-connected m-fold dominating set in general graphs
Zhang, Zhao, (2018)
-
Fault-Recovery and Coherence in Internet of Things Choreographies
Cherrier, Sylvain, (2017)
- More ...
-
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)
-
Computing minimum k-connected m-fold dominating set in general graphs
Zhang, Zhao, (2018)
- More ...