Abstract
We study geometric variations of the discriminating code problem. In the discrete version of the problem, a finite set of points P and a finite set of objects S are given in \(\mathbb {R}^d\). The objective is to choose a subset \(S^* \subseteq S\) of minimum cardinality such that for each point \(p_i \in P\), the subset \(S_i^* \subseteq S^*\) covering \(p_i\) satisfies \(S_i^*\ne \emptyset \), and each pair \(p_i,p_j \in P\), \(i \ne j\), we have \(S_i^* \ne S_j^*\). In the continuous version of the problem, the solution set \(S^*\) can be chosen freely among a (potentially infinite) class of allowed geometric objects. In the 1-dimensional case (\(d=1\)), the points in P are placed on a horizontal line L, and the objects in S are finite-length line segments aligned with L (called intervals). We show that the discrete version of this problem is NP-complete. This is somewhat surprising as the continuous version is known to be polynomial-time solvable. This is also in contrast with most geometric covering problems, which are usually polynomial-time solvable in one dimension. Still for the 1-dimensional discrete version, we design a polynomial-time 2-approximation algorithm. We also design a PTAS for both discrete and continuous versions in one dimension, for the restriction where the intervals are all required to have the same length. We then study the 2-dimensional case (\(d=2\)) for axis-parallel unit square objects. We show that both continuous and discrete versions are NP-complete, and design polynomial-time approximation algorithms that produce \((16\cdot OPT+1)\)-approximate and \((64\cdot OPT+1)\)-approximate solutions respectively, using rounding of suitably defined integer linear programming problems. Finally, we apply our techniques to a related variant of the discrete problem, where instead of points and geometric objects we just have a set S of objects. The goal is to select a small subset \(S^*\) of objects so that all objects of S are discriminated by their intersection with the objects of \(S^*\). This problem can be viewed as a graph problem by stating it in terms of the vertices of the geometric intersection graph of S. Under this graph-theoretical form, it is known as the identifying code problem. We show that the identifying code problem for axis-parallel unit square intersection graphs (in \(d=2\)) can be solved in the same manner as for the discrete version of the discriminating code problem for unit square objects described above, and all our positive approximation results still hold in this setting.
Similar content being viewed by others
Notes
Note that, the \((4+\epsilon )\) factor approximation algorithms presented in the conference version of this paper [13] were wrong and the algorithms have been corrected here.
If a literal does not appear in any clause, then we can assign a truth value to its variable so that all its occurrences are true, and further ignore this variable.
References
Acharyya, A., Nandy, S.C., Pandit, S., Roy, S.: Covering segments with unit squares. Comput. Geom. 79, 1–13 (2019)
Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. 11(3), 209–218 (1998)
Basu, K., Dey, S., Nandy, S.C., Sen, A.: Sensor networks for structural health monitoring of critical infrastructures using identifying codes. In: 15th International Conference on the Design of Reliable Communication Networks (DRCN), pp. 43–50 (2019)
Bazgan, C., Foucaud, F., Sikora, F.: Parameterized and approximation complexity of partial VC dimension. Theor. Comput. Sci. 766, 1–15 (2019)
Boland, R.P., Urrutia, J.: Separating collections of points in Euclidean spaces. Inf. Process. Lett. 53, 177–183 (1995)
Bousquet, N., Lagoutte, A., Li, Z., Parreau, A., Thomassé, S.: Identifying codes in hereditary classes of graphs and VC-dimension. SIAM J. Discrete Math. 29, 2047–2064 (2015)
Charbit, E., Charon, I., Cohen, G.D., Hudry, O.: Discriminating codes in bipartite graphs. Electron. Notes Discrete Math. 26, 29–35 (2006)
Charon, I., Cohen, G.D., Hudry, O., Lobstein, A.: Discriminating codes in (bipartite) planar graphs. Eur. J. Comb. 29, 1353–1364 (2008)
Charon, I., Hudry, O., Lobstein, A.: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theor. Comput. Sci. 290, 2109–2120 (2003)
Călinescu, G., Dumitrescu, A., Karloff, H., Wan, P.-J.: Separating points by axis-parallel lines. Int. J. Comput. Geom. Appl. 15(06), 575–590 (2005)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer-Verlag TELOS, USA (2008)
de Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Hurkens, A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Program. 98, 477–491 (2003)
Dey, S., Foucaud, F., Nandy, S.C., Sen, A.: Discriminating Codes in Geometric Setups. In: Cao,Y., Cheng, S.-W., Li, M. (eds) 31st International Symposium on Algorithms and Computation (ISAAC 2020), vol. 181 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 24:1–24:16, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum für Informatik (2020)
Even, G., Rawitz, D., Shahar, S.: Hitting sets when the VC-dimension is small. Inform. Process. Lett. 95, 358–362 (2005)
Foucaud, F.: Combinatorial and algorithmic aspects of identifying codes in graphs. In: PhD thesis, Université Bordeaux 1, France (2012)
Foucaud, F.: Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes. J. Discrete Algorithms 31, 48–68 (2015)
Foucaud, F., Gravier, S., Naserasr, R., Parreau, A., Valicov, P.: Identifying codes in line graphs. J. Graph Theory 73, 425–448 (2013)
Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Identification, location-domination and metric dimension on interval and permutation graphs II. Algorithms and complexity. Algorithmica 78, 914–944 (2017)
Gledel, V., Parreau, A.: Identification of points using disks. Discrete Math. 342, 256–269 (2019)
Habib, M., Paul, C., Viennot, L.: A synthesis on partition refinement: a useful routine for strings, graphs, boolean matrices and automata. In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS ’98, pp 25–38, Berlin, Heidelberg. Springer-Verlag (1998)
Har-Peled, S., Jones, M.: On separating points by lines. Discrete Comput. Geom. 63, 705–730 (2020)
Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44, 599–611 (1998)
Katz, M.J., Mitchell, J.S.B., Nir, Y.: Orthogonal segment stabbing. Comput. Geom. 30(2), 197–205 (2005)
Knuth, D.E.: The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd edn. Mass, Addison-Wesley, Reading (1997)
D. Krupa R., A. Basu Roy, M. De, and S. Govindarajan. Demand hitting and covering of intervals. In: Algorithms and Discrete Applied Mathematics (CALDAM’17), pp 267–280, Cham. Springer International Publishing (2017)
Laifenfeld, M., Trachtenberg, A.: Identifying codes and covering problems. IEEE Trans. Inf. Theory 54, 3929–3950 (2008)
Laifenfeld, M., Trachtenberg, A., Cohen, R., Starobinski, D.: Joint monitoring and routing in wireless sensor networks using robust identifying codes. Mob. Netw. Appl. 14, 415–432 (2009)
Lee, D.T.: Interval, segment, range, and priority search trees. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications. Chapman and Hall/CRC (2004)
McCreight, E.M.: Priority search trees. SIAM J. Comput. 14(2), 257–276 (1985)
Micali, S., Vazirani, V.V.: An O(sqrt(\(\vert \)V\(\vert \)) \(\vert \)E\(\vert \)) algorithm for finding maximum matching in general graphs. In: Annual Symposium on Foundations of Computer Science, pp. 17–27 (1980)
Müller, T., Sereni, J.-S.: Identifying and locating-dominating codes in (random) geometric networks. Comb. Probab. Comput. 18(6), 925–952 (2009)
Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discret. Comput. Geom. 44, 883–895 (2010)
Misra, H. M. N., Sethia, A.: Red-blue point separation for points on a circle. In: Proceedings of the 32nd Canadian Conference on Computational Geometry (CCCG) (2020)
Nandy, S.C., Asano, T., Harayama, T.: Shattering a set of objects in 2D. Discret. Appl. Math. 122(1), 183–194 (2002)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall Inc, Upper Saddle River, NJ, USA (1982)
Raman, R.: Private Communication(2022)
Ray, S., Starobinski, D., Trachtenberg, A., Ungrangsi, R.: Robust location detection with sensor networks. IEEE J. Sel. Areas Commun. 22, 1016–1025 (2004)
Schrijver, A., Berlin, S.-V.: Combinatorial optimization: polyhedra and efficiency. Number vol. 1 in Algorithms and Combinatorics. Springer (2003)
Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 46(3), 362–394 (1999)
Tovey, C.A.: A simplified NP-complete satisfiability problem. Discret. Appl. Math. 8(1), 85–89 (1984)
van Bevern, R., Bredereck, R., Bulteau, L., Chen, J., Froese, V., Niedermeier, R., Woeginger, G.J.: Partitioning perfect graphs into stars. J. Graph Theory 85(2), 297–335 (2017)
Acknowledgements
We thank the anonymous referees for their helpful comments that helped us improving the quality of the paper. We also thank Rajiv Raman for helpful discussions and for sharing his lecture notes [36] with us.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
We do not have such Conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This author was partially funded by the French government IDEX-ISITE initiative 16-IDEX-0001 (CAP 20-25), by the ANR project GRALMECO (ANR-21-CE48-0004-01), by the ANR project HOSIGRA (ANR-17-CE40-0022) and by the IFCAM project ”Applications of graph homomorphisms” (MA/IFCAM/18/39)
This work is part of the author’s PhD thesis submitted to Indian Statistical Institute, Kolkata.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Dey, S., Foucaud, F., Nandy, S.C. et al. Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica 85, 1850–1882 (2023). https://doi.org/10.1007/s00453-022-01073-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-022-01073-0