It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...