A two phase removing algorithm for minimum independent dominating set problem

2020 ◽  
Vol 88 ◽  
pp. 105949 ◽  
Author(s):  
Yiyuan Wang ◽  
Chenxi Li ◽  
Minghao Yin
Keyword(s):  
Dominating Set ◽  
Two Phase ◽  
Dominating Set Problem ◽  
Independent Dominating Set

scholarly journals Independent dominating set problem revisited

2015 ◽  
Vol 562 ◽  
pp. 1-22 ◽  
Author(s):  
Ching-Hao Liu ◽  
Sheung-Hung Poon ◽  
Jin-Yong Lin
Keyword(s):  
Dominating Set ◽  
Dominating Set Problem ◽  
Independent Dominating Set

scholarly journals Independent sets in (P₆, diamond)-free graphs

2009 ◽  
Vol Vol. 11 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Raffaele Mosca
Keyword(s):  
Polynomial Time ◽  
Dominating Set ◽  
Minimum Weight ◽  
Independent Set ◽  
Independent Sets ◽  
Maximum Weight ◽  
Independent Set Problem ◽  
International Audience ◽  
Dominating Set Problem ◽  
Independent Dominating Set

Graphs and Algorithms International audience We prove that on the class of (P6,diamond)-free graphs the Maximum-Weight Independent Set problem and the Minimum-Weight Independent Dominating Set problem can be solved in polynomial time.

A memetic algorithm for minimum independent dominating set problem

2017 ◽  
Vol 30 (8) ◽  
pp. 2519-2529 ◽  
Author(s):  
Yiyuan Wang ◽  
Jiejiang Chen ◽  
Huanyao Sun ◽  
Minghao Yin
Keyword(s):  
Memetic Algorithm ◽  
Dominating Set ◽  
Dominating Set Problem ◽  
Independent Dominating Set

A path cost-based GRASP for minimum independent dominating set problem

2016 ◽  
Vol 28 (S1) ◽  
pp. 143-151 ◽  
Author(s):  
Yiyuan Wang ◽  
Ruizhi Li ◽  
Yupeng Zhou ◽  
Minghao Yin
Keyword(s):  
Dominating Set ◽  
Path Cost ◽  
Dominating Set Problem ◽  
Independent Dominating Set

MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS

2009 ◽  
Vol 01 (01) ◽  
pp. 45-57 ◽  
Author(s):  
DEYING LI ◽  
LIN LIU ◽  
HUIQIANG YANG
Keyword(s):  
Wireless Networks ◽  
Undirected Graph ◽  
Dominating Set ◽  
Approximation Ratio ◽  
Dominating Set Problem ◽  
Simulation Results

In this paper, we study the connected r-hop k-dominating set problem in wireless networks. We propose two algorithms for the problem. We prove that algorithm I for UDG has (2r + 1)3 approximate ratio for k ≤ (2r + 1)2 and (2r + 1)((2r + 1)2 + 1)-approximate ratio for k > (2r + 1)2. And algorithm II for any undirected graph has (2r + 1) ln (Δr) approximation ratio, where Δr is the largest cardinality among all r-hop neighborhoods in the network. The simulation results show that our algorithms are efficient.

Sign in / Sign up

Export Citation Format

Share Document