Identifying codes and covering problems

IEEE Transactions on Information Theory

Volumn 54, Issue 9, 2008, Pages 3929-3950

  Laifenfeld, Moshe ^a,b   Trachtenberg, Ari ^a  

^a Boston University   (United States)

^b USA   (United States)

Author keywords

Distributed algorithms; Hardness of approximation; Identifying codes; Robust identifying codes; Set cover; Test cover

Indexed keywords

BINARY CODES; ELECTRIC FAULT CURRENTS; FAULT DETECTION; GRAPH THEORY; INFORMATION THEORY; POLYNOMIAL APPROXIMATION; WIRELESS TELECOMMUNICATION SYSTEMS;

DISTRIBUTED ALGORITHMS; HARDNESS OF APPROXIMATION; IDENTIFYING CODES; ROBUST IDENTIFYING CODES; SET COVER; TEST COVER;

SET THEORY;

EID: 51549109363     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.928263     Document Type: Article

References (45)

1. M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, "A new class of codes for identification of vertices in graphs," IEEE Trans. Inf. Theory, vol. 44, no. 2, pp. 599-611, Mar. 1998.
2. S. Ray, R. Ungrangsi, F. D. Pellegrinin, A. Trachtenberg, and D. Starobinski, "Robust location detection in emergency sensor networks," in Proc. INFOCOM, San Francisco, CA, Apr. 2003, pp. 1044-1053.
3. R. Ungrangsi, A. Trachtenberg, and D. Starobinski, "An implementation of indoor location detection systems based on identifying codes," in Proc. IFIP Int. Conf. Intelligence in Communication Systems (INTELLCOMM 04), Bangkok, Thailand, Nov. 2004, pp. 175-189.
4. S. Ray, D. Starobinski, A. Trachtenberg, and R. Ungrangsi, "Robust location detection with sensor networks," IEEE J. Sel. Areas Commun. vol. 22, no. 6, pp. 1016-1025, Aug. 2004.
5. M. Laifenfeld and A. Trachtenberg, "Disjoint identifying codes for arbitrary graphs," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 244-288.
6. I. Honkala, M. Karpovsky, and L. Levitin, "On robust and dynamic identifying codes," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 599-612, Feb. 2006.
7. T. Y. Berger-Wolf, W. E. Hart, and J. Saia, "Discrete sensor placement problems in distribution networks," J. Math. Comp. Modeling, vol. 42, no. 13, pp. 1385-1396, Dec. 2005.
8. M. Laifenfeld, A. Trachtenberg, R. Cohen, and D. Starobinski, "Joint monitoring and routing in wireless sensor networks using robust identifying codes," in Proc. IEEE Broadnets 2007, Raleigh, NC, Sep. 2007, pp. 197-206.
9. M. Laifenfeld, A. Trachtenberg, and T. Berger-Wolf, "Identifying codes and the set cover problem," in Proc. 44th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 2006.
10. J. Moncel, "Constructing codes identifying sets of vertices," Des., Codes, Cryptogr., vol. 41, no. 1, pp. 23-31, Oct.. 2006.
11. I. Honkala and A. Lobstein, "On identifying codes in binary Hamming spaces," J. Comb. Theory, Ser.A, vol. 99, no. 2, pp. 232-243, 2002.
12. Y. Ben-Haim and S. Litsyn, "Exact minimum density of codes identifying vertices in the square grid," SIAM J. Discr. Math., vol. 19, no. 1, pp. 69-82, 2005.
13. S. R. T. Laihonen, "Codes identifying sets of vertices," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2001, vol. 2227.
14. A. Frieze, R. Martin, J. Moncel, M. Ruszinko, and C. Smyth, "Identifying codes in random networks," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1464-1467.
15. P. Slater, "Fault-tolerant locating-dominating sets," Discr. Math. vol. 249, pp. 179-189, 2002.
16. I. Charon, O. Hudry, and A. Lobstein, "Identifying and locating-dominating codes: NP-completeness results for directed graphs," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2192-2200, Aug. 2002.
17. S. Gravier, R. Klasing, and J. Moncel, Hardness Results and Approximation Algorithms for Identifying Codes and Locating-Dominating Codes in Graphs LaBRI, 2006, Tech. Rep. RR-1417-06.
18. J. Suomela, "Approximability of identifying codes and locating-dominating codes," Inf. Processing Lett., vol. 103, no. 1, pp. 28-33, 2007.
19. K. B. Lakshmanan, D. J. Rosenkrantz, and S. S. Ravi, "Alarm placement in systems with fault propagation," Theor. Comp. Sci., vol. 243, no. 1-2, pp. 269-288, 2000.
20. I. Charon, O. Hudry, and A. Lobstein, "Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard," Theor. Comp. Sci., vol. 290, no. 3, pp. 2109-2120, 2003.
21. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. Cambridge, MA: MIT Press, 2001.
22. I. Charon, S. Gravier, O. Hudry, A. Lobstein, M. Mollard, and J. Moncel, "A linear algorithm for minimum 1-identifying codes in oriented trees," Discr. Appl. Math., vol. 154, no. 8, pp. 1246-1253, 2006.
23. G. D. Cohen, I. S. Honkala, A. Lobstein, and G. Zémor, "New bounds for codes identifying vertices in graphs," Electron. J. Comb., vol. 6, 1999.
24. I. Charon, I. S. Honkala, O. Hudry, and A. Lobstein, "General bounds for identifying codes in some infinite regular graphs," Electron. J. Comb., vol. 8, no. 1, 2001.
25. I. Charon, O. Hudry, and A. Lobstein, "Identifying codes with small radius in some infinite regular graphs," Electron. J. Comb., vol. 9, no. 1, 2002.
26. I. Charon, I. S. Honkala, O. Hudry, and A. Lobstein, "The minimum density of an identifying code in the king lattice," Discr. Math. vol. 276, no. 1-3, pp. 95-109, 2004.
27. 2 (n + 1 " Discr. Appl. Math., vol. 154, no. 14, pp. 2032-2039, 2006.
28. U. Feige, "A threshold of ln n for approximating set cover," J. ACM vol. 45, no. 4, pp. 634-652, 1998.
29. P. Berman, B. DasGupta, and M.-Y. Kao, "Tight approximability results for test set problems in bioinformatics," J. Comp. Syst. Sci., vol. 71, no. 2, pp. 145-162, 2005.
30. R. Raz and S. Safra, "A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of np," in STOC '97: Proc 29th Annu. ACM Symp. Theory of Computing, New York, 1997, pp. 475-484.
31. T. Müller and J.-S. Sereni, "Identifying and locating-dominating codes in (random) geometric networks", submitted for publication Combinatorics, Probability and Computing, ser. ITI 2006-323 and KAM-DIMATIA 206-797, 2007.
32. L. Lovasz, "On the ratio of optimal integral and fractional covers," Discr. Math., vol. 13, pp. 383-390, 1975.
33. D. S. Johnson, "Approximation algorithms for combinatorial problems," J. Comp. Syst. Sci., vol. 9, pp. 256-278, 1974.
34. P. Slavik, "A tight analysis of the greedy algorithm for set cover," in Proc. 28th Annu. ACM Sym. Theory of Computing, Philadelphia, PA, May 1996, pp. 435-439.
35. S. Rajagopalan and V. Vazirani, "Primal-dual RNC approximation algorithms for set cover and covering integer programs," SIAM J. Computing, vol. 28, pp. 525-540, 1998.
36. V. Vazirani, Approximation Algorithms. New York: Springer-Verlag, 2001.
37. K. M. J. D. Bontridder, B. J. Lageweg, J. K. Lenstra, J. B. Orlin, and L. Stougie, "Branch-and-bound algorithms for the test cover problem," in ESA '02: Proc. 10th Annu. Europ. Symp. Algorithms, London, U.K., 2002, pp. 223-233.
38. K. M. J. D. Bontridder, B. V. Halldórsson, M. M. Halldórsson, C. A. J. Hurkens, J. K. Lenstra, R. Ravi, and L. Stougie, "Approximation algorithms for the test cover problem," Math. Programming-B, vol. 98, no. 1-3, pp. 477-491, 2003.
39. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman & Co, 1979.
40. B. M. E. Moret and H. D. Shapiro, "On minimizing a set of tests," SIAM J. Scient. Statist. Computing, vol. 6, pp. 983-1003, 1985.
41. M. Naor, L. J. Schulman, and A. Srinivasan, "Splitters and near-optimal derandomization," in Proc. IEEE Symp. Foundations of Computer Science, Milwaukee, WI, Oct. 1995, pp. 182-191 [Online]. Available: citeseer.ist.psu.edu/naor95splitters.html
42. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes. Amsterdam, The Netherlands: Elsevier, 1997.
43. Y. Bartal, J. W. Byers, and D. Raz, "Global optimization using local information with applications to flow control," in Proc. IEEE Symp. Foundations of Computer Science, Miami Beach, FL, Oct. 1997, pp. 303-312 [Online]. Available: Citeseer.ist.psu.edu/bartal97global.html
44. F.Kuhn and R.Wattenhofer, "Constant-time distributed dominating set approximation," in Proc. 22nd ACM Symp. Principles of Distributed Computing (PODC'03), Boston, MA, Jul. 2003, pp. 25-32 [Online]. Available: Citeseer.ist.psu.edu/kuhn03constanttime.html
45. M. Laifenfeld, "Coding for Network Applications: Robust Identification and Distributed Resource Allocation," Ph.D. dissertation, Boston Univ., Bostaon, MA, 2007.