Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
From MaRDI portal
Publication:5131721
DOI10.1287/ijoc.2017.0776OpenAlexW2791998335MaRDI QIDQ5131721
Jiao Zhou, Zhao Zhang, Ding-Zhu Du, Shaojie Tang, Xiao-hui Huang
Publication date: 9 November 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2017.0776
Related Items (7)
Approximating \(k\)-connected \(m\)-dominating sets ⋮ Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage ⋮ A game theoretic approach for minimal connected dominating set ⋮ Optimal channel assignment with list-edge coloring ⋮ Construction of minimum edge-fault tolerant connected dominating set in a general graph ⋮ Approximating k-Connected m-Dominating Sets ⋮ A greedy algorithm for the fault-tolerant outer-connected dominating set problem
Cites Work
- Unnamed Item
- Connectivity and tree structure in finite graphs
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- A sequential algorithm for generating random graphs
- A greedy approximation for minimum connected dominating sets
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- Solving connected dominating set faster than \(2^n\)
- On minimum \(m\)-connected \(k\)-dominating set problem in unit disc graphs
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
- Graph minors. X: Obstructions to tree-decomposition
- Über n-fach zusammenhängende Eckenmengen in Graphen
- Approximation algorithms for connected dominating sets
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
- Dual-Based Local Search for the Connected Facility Location and Related Problems
- Spanning Trees with Many Leaves
- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET
- $k$-Blocks: A Connectivity Invariant for Graphs
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
This page was built for publication: Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
