Gravier, S., Klasing, R., & Moncel, J. (2008). Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs. Algorithmic Operations Research, 3(1). Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/2808