The Minimum Weight Dominating Set Problem under Hybrid Uncertain Environments

被引:0
|
作者
Wang, Chenyin [1 ]
Luo, Dongling [2 ]
Zeng, Mowei [2 ]
Yi, Yang [2 ]
Zhou, Xiaocong [2 ]
机构
[1] Sun Yat Sen Univ, Xinhua Coll, Guangzhou 510275, Guangdong, Peoples R China
[2] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510275, Guangdong, Peoples R China
来源
ADVANCED DEVELOPMENT IN AUTOMATION, MATERIALS AND MANUFACTURING | 2014年 / 624卷
关键词
Dominating set; Random fuzzy theory; Random fuzzy simulation; Genetic algorithm;
D O I
10.4028/www.scientific.net/AMM.624.545
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The minimum weight dominating set problem (MWDSP) has been a popular research topic in recent years. The weights of vertexes may be considered as cost, time, or opponent's payoff, which are uncertain in most cases. This paper discusses MWDSP under hybrid uncertain environments where the weights of vertexes are random fuzzy variables. First, random fuzzy theory is introduced to describe these hybrid uncertain variables. Then we propose three decision models based on three different decision criteria to solve MWDSP under hybrid uncertain environments. To solve the proposed models, we present a hybrid intelligent algorithm where random fuzzy simulation and genetic algorithm are embedded. Numerical experiments are performed in the last to show the robustness and effectiveness of the presented hybrid intelligent algorithm.
引用
收藏
页码:545 / 548
页数:4
相关论文
共 50 条
  • [41] Complete Complexity Dichotomies for the Dominating Set Problem
    G. S. Dakhno
    D. S. Malyshev
    Mathematical Notes, 2025, 117 (1) : 62 - 74
  • [42] The Constant Inapproximability of the Parameterized Dominating Set Problem
    Chen, Yijia
    Lin, Bingkai
    2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 505 - 514
  • [43] On-line algorithms for the dominating set problem
    King, GH
    Tzeng, WG
    INFORMATION PROCESSING LETTERS, 1997, 61 (01) : 11 - 14
  • [44] On the advice complexity of the online dominating set problem
    Bockenhauer, Hans-Joachim
    Hromkovicc, Juraj
    Krug, Sacha
    Unger, Walter
    THEORETICAL COMPUTER SCIENCE, 2021, 862 : 81 - 96
  • [45] Boundary classes of graphs for the dominating set problem
    Alekseev, VE
    Korobitsyn, DV
    Lozin, VV
    DISCRETE MATHEMATICS, 2004, 285 (1-3) : 1 - 6
  • [46] THE CONSTANT INAPPROXIMABILITY OF THE PARAMETERIZED DOMINATING SET PROBLEM
    Chen, Yijia
    Lin, Bingkai
    SIAM JOURNAL ON COMPUTING, 2019, 48 (02) : 513 - 533
  • [47] Approximation for dominating set problem with measure functions
    Chen, N
    Meng, J
    Rong, J
    Zhu, H
    COMPUTING AND INFORMATICS, 2004, 23 (01) : 37 - 49
  • [48] An O(n+m)-time algorithm for finding a minimum-weight dominating set in a permutation graph
    Rhee, C
    Liang, YD
    Dhall, SK
    Lakshmivarahan, S
    SIAM JOURNAL ON COMPUTING, 1996, 25 (02) : 404 - 419
  • [49] PTAS for the minimum weighted dominating set in growth bounded graphs
    Zhong Wang
    Wei Wang
    Joon-Mo Kim
    Bhavani Thuraisingham
    Weili Wu
    Journal of Global Optimization, 2012, 54 : 641 - 648
  • [50] PTAS for the minimum weighted dominating set in growth bounded graphs
    Wang, Zhong
    Wang, Wei
    Kim, Joon-Mo
    Thuraisingham, Bhavani
    Wu, Weili
    JOURNAL OF GLOBAL OPTIMIZATION, 2012, 54 (03) : 641 - 648