Hardness results and approximation algorithm for total liar's domination in graphs
type: Item
instance of: scholarly article
title: Hardness results and approximation algorithm for total liar's domination in graphs
zbMATH Open document ID: 1297.90170
author: B. S. Panda
author: S. Paul
published in: Journal of Combinatorial Optimization
publication date: 2014-06-24T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6307080
zbMATH Keywords: domination
zbMATH Keywords: liar's domination
zbMATH Keywords: chordal graph
zbMATH Keywords: graph algorithm
zbMATH Keywords: approximation algorithm
zbMATH Keywords: NP-completeness
zbMATH Keywords: APX-completeness
MaRDI profile type: Publication
full work available at URL: s10878-012-9542-3
OpenAlex ID: W2170298940
cites work: Some APX-completeness results for cubic graphs
cites work: Q4258216
cites work: Total domination in interval graphs
cites work: Liar's domination in graphs
cites work: On domination problems for permutation and other graphs
cites work: Labeling algorithms for domination problems in sun-free chordal graphs
cites work: Total domination in block graphs
cites work: Approximation hardness of dominating set problems in bounded degree graphs
cites work: Total domination in graphs
cites work: Introduction to algorithms
cites work: Double total domination of graphs
cites work: Q4552196
cites work: Q4368728
cites work: Q4368729
cites work: A survey of selected recent results on total domination in graphs
cites work: \(k\)-tuple total domination in graphs
cites work: Reducibility among Combinatorial Problems
cites work: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
cites work: On the Algorithmic Complexity of Total Domination
cites work: Algorithmic aspect of \(k\)-tuple domination in graphs.
cites work: \(k\)-tuple domination in graphs
cites work: Q3616664
cites work: Liar's domination
DOI: 10.1007/S10878-012-9542-3
description: scientific article; zbMATH DE number 6307080