The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm
Given a graph G(V, E), the identifying codes problem is to find the smallest set of vertices D ⊆ V such that no two vertices in V are adjacent to the same set of vertices in D. The identifying codes problem has been applied to fault diagnosis and sensor based location detection in harsh environments. In this paper, we introduce and study a generalization of this problem, namely, the d-identifying codes problem. We propose a polynomial time approximation algorithm based on ideas from information theory and establish its approximation ratio that is very close to the best possible. Using analysis on random graphs, several fundamental properties of the optimal solution to this problem are also derived.
KeywordsEquivalence Class Approximation Algorithm Greedy Algorithm Random Graph Approximation Ratio
Unable to display preview. Download preview PDF.
- 2.Brodie, M., Rish, I., Ma, S.: Optimizing probe selection for fault localization. In: International Workshop on Distributed Systems: Operations and Management (2001)Google Scholar
- 3.Das, A., Thulasiraman, K.: Diagnosis of t/s-diagnosable systems. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 193–205 (1990)Google Scholar
- 5.Frieze, A., Martin, R., Moncel, J., Ruszinkóand, K., Smyth, C.: Codes identifying sets of vertices in random networks. (submitted for publication, 2005)Google Scholar
- 10.Laifenfeld, M., Trachtenberg, A.: Disjoint identifying-codes for arbitrary graphs. In: IEEE Symposium on Information Theory (submitted, 2005) Google Scholar
- 13.Ray, S., Ungrangsi, R., Pellegrini, F., Trachtenberg, A., Starobinski, D.: Robust location detection in emergency sensor networks. In: INFOCOM (2003)Google Scholar