Approximability of identifying codes and locating-dominating codes

Information Processing Letters

Volumn 103, Issue 1, 2007, Pages 28-33

  Suomela, Jukka ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Approximation algorithms; Combinatorial problems; Graph algorithms; Identifying codes; Locating dominating codes

Indexed keywords

CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; POLYNOMIALS; PROBLEM SOLVING;

COMBINATORIAL PROBLEMS; GRAPH ALGORITHMS; IDENTIFYING CODES; LOCATING DOMINATING CODES;

APPROXIMATION ALGORITHMS;

EID: 34247174465     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.02.001     Document Type: Article

References (20)

1. Charon I., Hudry O., and Lobstein A. Identifying and locating-dominating codes: NP-completeness results for directed graphs. IEEE Transactions on Information Theory 48 8 (2002) 2192-2200
2. Charon I., Hudry O., and Lobstein A. Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theoretical Computer Science 290 3 (2003) 2109-2120
3. Chvátal V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4 3 (1979) 233-235
4. Cohen G., Honkala I., Lobstein A., and Zémor G. On identifying codes. Proc. DIMACS Workshop on Codes and Association Schemes (Piscataway, NJ, USA, 1999). DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 56 (2001), American Mathematical Society, Providence, RI, USA 97-109
5. Colbourn C.J., Slater P.J., and Stewart L.K. Locating dominating sets in series parallel networks. Congressus Numerantium 56 (1987) 135-162
6. Doyle P.G., and Snell J.L. Random Walks and Electric Networks. The Carus Mathematical Monographs vol. 22 (1984), The Mathematical Association of America, Washington, DC, USA
7. Garg N., and Könemann J. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Proc. 39th Annual Symposium on Foundations of Computer Science (FOCS, Palo Alto, CA, USA, November 1998) (1998), IEEE Computer Society, Los Alamitos, CA, USA 300-309
8. Hunt III H.B., Marathe M.V., Radhakrishnan V., Ravi S.S., Rosenkrantz D.J., and Stearns R.E. NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Journal of Algorithms 26 2 (1998) 238-274
9. Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974) 256-278
10. Karpovsky M., Chakrabarty K., and Levitin L. On a new class of codes for identifying vertices in graphs. IEEE Transactions on Information Theory 44 2 (1998) 599-611
11. Khanna S., Motwani R., Sudan M., and Vazirani U. On syntactic versus computational views of approximability. SIAM Journal on Computing 28 1 (1999) 164-191
12. Khuller S., Raghavachari B., and Rosenfeld A. Landmarks in graphs. Discrete Applied Mathematics 70 3 (1996) 217-229
13. Krishnamachari B. Networking Wireless Sensors (2005), Cambridge University Press, Cambridge, UK
14. Laifenfeld M., and Trachtenberg A. Disjoint identifying-codes for arbitrary graphs. Proc. International Symposium on Information Theory (ISIT, Adelaide, Australia, September 2005) (2005), IEEE, Piscataway, NJ, USA 244-248
15. Lakshmanan K.B., Rosenkrantz D.J., and Ravi S.S. Alarm placement in systems with fault propagation. Theoretical Computer Science 243 1-2 (2000) 269-288
16. Lobstein A. Codes identifiants et localisateurs-dominateurs dans les graphes: une bibliographie (January 2007). http://perso.enst.fr/~lobstein/bibLOCDOMetID.html
17. Lund C., and Yannakakis M. On the hardness of approximating minimization problems. Journal of the ACM 41 5 (1994) 960-981
18. J. Moncel, Optimal graphs for identification of vertices in networks, Technical Report 138, Laboratoire Leibniz, Grenoble, France, November 2005
19. Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43 3 (1991) 425-440
20. Slater P.J. Domination and location in acyclic graphs. Networks 17 1 (1987) 55-64