scientific article; zbMATH DE number 2209525
From MaRDI portal
Publication:5692521
zbMath1117.90303MaRDI QIDQ5692521
Jeremy Blum, Min Ding, Xiuzhen Cheng, Andrew Thaeler
Publication date: 28 September 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
On the parameterized complexity of reconfiguration of connected dominating sets ⋮ On approximating (connected) 2-edge dominating set by a tree ⋮ New analysis and computational study for the planar connected dominating set problem ⋮ Two algorithms for minimum 2-connected \(r\)-hop dominating set ⋮ The \(k\)-leaf spanning tree problem admits a klam value of 39 ⋮ A distributed approximation algorithm for the bottleneck connected dominating set problem ⋮ The \(k\)-hop connected dominating set problem: approximation and hardness ⋮ The price of connectivity for dominating set: upper bounds and complexity ⋮ On positive influence dominating sets in social networks ⋮ A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs ⋮ A note on connected dominating sets of distance-hereditary graphs ⋮ Nordhaus-Gaddum-type results on the connected edge domination number ⋮ An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs ⋮ An exact algorithm for connected red-blue dominating set ⋮ Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem ⋮ A cutting-plane algorithm for solving a weighted influence interdiction problem ⋮ 2-(edge-)connected edge domination number and matching number ⋮ On dominating sets whose induced subgraphs have a bounded diameter ⋮ Tighter approximation bounds for minimum CDS in unit disk graphs ⋮ Solving connected dominating set faster than \(2^n\) ⋮ On Approximating (Connected) 2-Edge Dominating Set by a Tree ⋮ Linear separation of connected dominating sets in graphs ⋮ A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph ⋮ On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
This page was built for publication:
