Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
type: Item
instance of: scholarly article
title: Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
zbMATH Open document ID: 1178.68682
author: Ralf Klasing
author: Christian Laforest
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5576924
zbMATH Keywords: approximation algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: domination problems
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.10.004
OpenAlex ID: W1980243423
cites work: Some APX-completeness results for cubic graphs
cites work: Q4258216
cites work: Q4247463
cites work: Q3619797
cites work: A threshold of ln n for approximating set cover
cites work: Q4552196
cites work: Q4368729
cites work: Q4368728
cites work: Algorithmic aspect of \(k\)-tuple domination in graphs.
cites work: \(k\)-tuple domination in graphs
cites work: Simple heuristics for unit disk graphs
DOI: 10.1016/J.IPL.2003.10.004
description: scientific article; zbMATH DE number 5576924