PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Approximability of identifying codes and locating-dominating codes
Jukka Suomela
Information Processing Letters Volume 103, Number 1, pp. 28-33, 2007. ISSN 0020-0190


We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible to approximate both problems within a logarithmic factor, but sublogarithmic approximation ratios are intractable. In bounded-degree graphs, there is a trivial constant-factor approximation algorithm, but arbitrarily low approximation ratios remain intractable. In so-called local graphs, there is a polynomial-time approximation scheme. We also consider fractional packing of codes and a related problem of finding minimum-weight codes.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:3003
Deposited By:Jukka Suomela
Deposited On:23 May 2007