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 |
-
Model-free assortment pricing with transaction data
Chen, Ningyuan, (2023)
-
Adaptive two-stage stochastic programming with an analysis on capacity expansion planning problem
Basciftci, Beste, (2024)
-
Scheduling unrelated machines with two types of jobs
Vakhania, Nodari, (2014)
- More ...
-
Computing minimum k-connected m-fold dominating set in general graphs
Zhang, Zhao, (2018)
-
Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio
Zhang, Yaoyao, (2024)
-
Breaking the r max barrier : enhanced approximation algorithms for partial set multicover problem
Ran, Yingli, (2021)
- More ...