Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1277.68088
author: Sylvain Gravier
author: Ralf Klasing
author: Julien Moncel
publication date: 2013-12-11T00:00:00Z
full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/2808
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 6237440
zbMATH Keywords: approximation algorithms
zbMATH Keywords: approximation hardness
zbMATH Keywords: identifying codes
zbMATH Keywords: locating-dominating codes
zbMATH Keywords: fault tolerance
zbMATH Keywords: domination problems
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
title: Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
published in: Algorithmic Operations Research
description: scientific article; zbMATH DE number 6237440