Breaking the O(In n) barrier : an enhanced approximation algorithm for fault-tolerant minimum weight connected dominating set
| Year of publication: |
2018
|
|---|---|
| Authors: | Zhou, Jiao ; Zhang, Zhao ; 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. 225-235
|
| Subject: | connected dominating set | weight | approximation algorithm | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Approximation methods for multiobjective optimization problems : a survey
Herzel, Arne, (2021)
-
The provably good parallel seeding algorithms for the k-means problem with penalties
Li, Min, (2022)
-
Zhang, Jie, (2021)
- More ...
-
Computing minimum k-connected m-fold dominating set in general graphs
Zhang, Zhao, (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 ...