Identifying Codes and Covering Problems

The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1998, this problem has demonstrated its fundamental nature through a wide variety of applications, such as fault diagnosis, location detection, and environmental monitoring, in addition to deep connections to information theory, superimposed and covering codes, and tilings. This work establishes efficient reductions between the identifying code problem and the well-known set-covering problem, resulting in a tight hardness of approximation result and novel, provably tight polynomial-time approximations. The main results are also extended to r -robust identifying codes and analogous set (2r+1)-multicover problems. Finally, empirical support is provided for the effectiveness of the proposed approximations, including good constructions for well-known topologies such as infinite two-dimensional grids.

[1]  Iiro S. Honkala,et al.  The minimum density of an identifying code in the king lattice , 2004, Discret. Math..

[2]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[3]  Jean-Sébastien Sereni,et al.  Identifying and Locating-Dominating Codes in (Random) Geometric Networks , 2009, Comb. Probab. Comput..

[4]  Gérard D. Cohen,et al.  Covering Codes , 2005, North-Holland mathematical library.

[5]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[6]  Sylvain Gravier,et al.  Construction of Codes Identifying Sets of Vertices , 2005, Electron. J. Comb..

[7]  Julien Moncel,et al.  Constructing codes identifying sets of vertices , 2006, Des. Codes Cryptogr..

[8]  Antoine Lobstein,et al.  Identifying Codes with Small Radius in Some Infinite Regular Graphs , 2002, Electron. J. Comb..

[9]  S. S. Ravi,et al.  Alarm placement in systems with fault propagation , 2000, Theor. Comput. Sci..

[10]  Roger Wattenhofer,et al.  Constant-time distributed dominating set approximation , 2003, PODC '03.

[11]  Antoine Lobstein,et al.  Identifying and locating-dominating codes: NP-Completeness results for directed graphs , 2002, IEEE Trans. Inf. Theory.

[12]  Iiro S. Honkala,et al.  On Identifying Codes in Binary Hamming Spaces , 2002, J. Comb. Theory, Ser. A.

[13]  Danny Raz,et al.  Global optimization using local information with applications to flow control , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[14]  R. Ravi,et al.  Approximation algorithms for the test cover problem , 2003, Math. Program..

[15]  Aravind Srinivasan,et al.  Splitters and near-optimal derandomization , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[16]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[17]  Sylvain Gravier,et al.  Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs , 2008, Algorithmic Oper. Res..

[18]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[19]  Mark G. Karpovsky,et al.  On a New Class of Codes for Identifying Vertices in Graphs , 1998, IEEE Trans. Inf. Theory.

[20]  David Starobinski,et al.  An Implementation of Indoor Location Detection Systems Based on Identifying Codes , 2004, INTELLCOMM.

[21]  Gérard D. Cohen,et al.  New Bounds for Codes Identifying Vertices in Graphs , 1999, Electron. J. Comb..

[22]  Reuven Cohen,et al.  Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[23]  Francesco De Pellegrini,et al.  Robust location detection in emergency sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[24]  David Starobinski,et al.  Robust location detection with sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[25]  Alan M. Frieze,et al.  Identifying codes in random networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[26]  Antoine Lobstein,et al.  Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard , 2003, Theor. Comput. Sci..

[27]  William E. Hart,et al.  Discrete sensor placement problems in distribution networks , 2005, Math. Comput. Model..

[28]  Jukka Suomela,et al.  Approximability of identifying codes and locating-dominating codes , 2007, Inf. Process. Lett..

[29]  B. Moret,et al.  On Minimizing a Set of Tests , 1985 .

[30]  B. J. Lageweg,et al.  Branch-and-Bound Algorithms for the Test Cover Problem , 2002, ESA.

[31]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[32]  Ari Trachtenberg,et al.  Disjoint identifying-codes for arbitrary graphs , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[33]  Iiro S. Honkala,et al.  General Bounds for Identifying Codes in Some Infinite Regular Graphs , 2001, Electron. J. Comb..

[34]  Sylvain Gravier,et al.  A linear algorithm for minimum 1-identifying codes in oriented trees , 2006, Discret. Appl. Math..

[35]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[36]  Vijay V. Vazirani,et al.  Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..

[37]  Ming-Yang Kao,et al.  Tight approximability results for test set problems in bioinformatics , 2005, J. Comput. Syst. Sci..

[38]  Peter J. Slater,et al.  Fault-tolerant locating-dominating sets , 2002, Discret. Math..

[39]  T. Berger-Wolf,et al.  Identifying Codes and the Set Cover Problem , 2006 .

[40]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

[41]  Tero Laihonen,et al.  Codes Identifying Sets of Vertices , 2001, AAECC.

[42]  Julien Moncel,et al.  On graphs on n vertices having an identifying code of cardinality [log2(n+1)] , 2006, Discret. Appl. Math..

[43]  Mark G. Karpovsky,et al.  On robust and dynamic identifying codes , 2006, IEEE Transactions on Information Theory.

[44]  Simon Litsyn,et al.  Exact Minimum Density of Codes Identifying Vertices in the Square Grid , 2005, SIAM J. Discret. Math..