Hardness results and approximation algorithms of k-tuple domination in graphs

被引：54
|
作者：
Klasing, R
Laforest, C
机构：
[1] Univ Evry, LaMI, F-91000 Evry, France
[2] Univ Nice, INRIA, CNRS, MASCOTTE Project, F-06902 Sophia Antipolis, France
来源：
INFORMATION PROCESSING LETTERS | 2004年 / 89卷 / 02期
关键词：
approximation algorithms; combinatorial problems; domination problems;
D O I：
10.1016/j.ipl.2003.10.004
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The study of k-tuple domination problem in special graphs was presented. The complexity of the domination problem was analyzed by using the hardness results and approximation algorithms. In this regard, a linear-time algorithm for the 2-tuple domination problem in trees and in strongly chordal graphs was devised. The obtained approximation algorithm was a polynomial time algorithm whose output solution was compared with the optimal solution.
引用
收藏
页码：75 / 83
页数：9
相关论文
共 50 条
  • [21] k-tuple total domination in cross products of graphs
    Henning, Michael A.
    Kazemi, Adel P.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (03) : 339 - 346
  • [22] On the k-domination, k-tuple domination and Roman k-domination numbers in graphs
    Rad, Nader Jafari
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2019, 111 : 177 - 183
  • [23] Upper bounds on the k-tuple domination number and k-tuple total domination number of a graph
    Rad, Nader Jafari
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2019, 73 : 280 - 290
  • [24] Upper Bounds for k-Tuple (Total) Domination Numbers of Regular Graphs
    Sharareh Alipour
    Amir Jafari
    Morteza Saghafian
    Bulletin of the Iranian Mathematical Society, 2020, 46 : 573 - 577
  • [25] The k-tuple domination number revisited
    Zverovich, Vadim
    APPLIED MATHEMATICS LETTERS, 2008, 21 (10) : 1005 - 1011
  • [26] Upper Bounds for k-Tuple (Total) Domination Numbers of Regular Graphs
    Alipour, Sharareh
    Jafari, Amir
    Saghafian, Morteza
    BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2020, 46 (02) : 573 - 577
  • [27] Hardness results and approximation algorithms for (weighted) paired-domination in graphs
    Chen, Lei
    Lu, Changhong
    Zeng, Zhenbing
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5063 - 5071
  • [28] A note on Roman k-tuple domination number
    Abd Aziz, Noor A'lawiah
    Rad, Nader Jafari
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2022, 7 (02) : 273 - 274
  • [29] On the algorithmic complexity of k-tuple total domination
    Lan, James K.
    Chang, Gerard Jennhwa
    DISCRETE APPLIED MATHEMATICS, 2014, 174 : 81 - 91
  • [30] Linear kernels for k-tuple and liar's domination in bounded genus graphs
    Bishnu, Arijit
    Ghosh, Arijit
    Paul, Subhabrata
    DISCRETE APPLIED MATHEMATICS, 2017, 231 : 67 - 77
12345