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 条
  • [31] k-tuple domination on the bishop's graph
    Burchett, Paul A.
    UTILITAS MATHEMATICA, 2016, 101 : 351 - 358
  • [32] Hardness results, approximation and exact algorithms for liar's domination problem in graphs
    Panda, B. S.
    Paul, S.
    Pradhan, D.
    THEORETICAL COMPUTER SCIENCE, 2015, 573 : 26 - 42
  • [33] Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs
    Czygrinow, Andrzej
    Hanckowiak, Michal
    Szymanska, Edyta
    Wawrzyniak, Wojciech
    Witkowski, Marcin
    PRINCIPLES OF DISTRIBUTED SYSTEMS, OPODIS 2014, 2014, 8878 : 49 - 59
  • [34] New bounds on the k-domination number and the k-tuple domination number
    Rautenbach, Dieter
    Volkmann, Lutz
    APPLIED MATHEMATICS LETTERS, 2007, 20 (01) : 98 - 102
  • [35] A generalised upper bound for the k-tuple domination number
    Gagarin, Andrei
    Zverovich, Vadim E.
    DISCRETE MATHEMATICS, 2008, 308 (5-6) : 880 - 885
  • [36] Improved upper bounds for the k-tuple domination number
    Gagarin, Andrei
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 41 : 257 - 261
  • [37] Distributed local approximation of the minimum k-tuple dominating set in planar graphs
    Czygrinow, Andrzej
    Hanćkowiak, Michal
    Szymańska, Edyta
    Wawrzyniak, Wojciech
    Witkowski, Marcin
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8878 : 49 - 59
  • [38] A note on the k-tuple total domination number of a graph
    Kazenti, Adel P.
    TBILISI MATHEMATICAL JOURNAL, 2015, 8 (02): : 281 - 286
  • [39] On the k-tuple domination of de Bruijn and Kautz digraphs
    Araki, Toru
    INFORMATION PROCESSING LETTERS, 2007, 104 (03) : 86 - 90
  • [40] Approximation Algorithm and Hardness Results for Defensive Domination in Graphs
    Henning, Michael A.
    Pandey, Arti
    Tripathi, Vikash
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 247 - 261
12345