S. Gravier, R. Klasing, and J. Moncel, “Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs”, AOR, vol. 3, no. 1, Mar. 2008.