List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A new approximation algorithm for minimum-weight (1,m)-connected dominating set INFORMS Journal on Computing | 2025-11-19 | Paper |
| Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs INFORMS Journal on Computing | 2020-11-09 | Paper |
| Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set INFORMS Journal on Computing | 2020-11-09 | Paper |
| A greedy algorithm for the fault-tolerant connected dominating set in a general graph Journal of Combinatorial Optimization | 2014-09-05 | Paper |
Research outcomes over time
This page was built for person: Jiao Zhou
