Abstract
Let P be a set of n colored points in the plane. Introduced by Hart [7], a consistent subset of P, is a set \(S\subseteq P\) such that for every point p in \(P\setminus S\), the closest point of p in S has the same color as p. The consistent subset problem is to find a consistent subset of P with minimum cardinality. This problem is known to be NP-complete even for two-colored point sets. Since the initial presentation of this problem, aside from the hardness results, there has not been significant progress from the algorithmic point of view. In this paper we present the following algorithmic results:
-
1.
The first subexponential-time algorithm for the consistent subset problem.
-
2.
An \(O(n\log n)\)-time algorithm that finds a consistent subset of size two in two-colored point sets (if such a subset exists). Towards our proof of this running time we present a deterministic \(O(n \log n)\)-time algorithm for computing a variant of the compact Voronoi diagram; this improves the previously claimed expected running time.
-
3.
An \(O(n\log ^2 n)\)-time algorithm that finds a minimum consistent subset in two-colored point sets where one color class contains exactly one point; this improves the previous best known \(O(n^2)\) running time which is due to Wilfong (SoCG 1991).
-
4.
An O(n)-time algorithm for the consistent subset problem on collinear points that are given from left to right; this improves the previous best known \(O(n^2)\) running time.
-
5.
A non-trivial \(O(n^6)\)-time dynamic programming algorithm for the consistent subset problem on points arranged on two parallel lines.
To obtain these results, we combine tools from paraboloid lifting, planar separators, additively-weighted Voronoi diagrams with respect to convex distance functions, point location in farthest-point Voronoi diagrams, range trees, minimum covering of a circle with arcs, and several geometric transformations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In some previous works the points have labels, as opposed to colors.
- 2.
Wilfong shrinks the endpoint of \(A(b_i)\) that corresponds to \(cc(b_i)\) by half the clockwise angle from \(cc(b_i)\) to the next point, and shrinks the other endpoint of \(A(b_i)\) by half the counterclockwise angle from \(c(b_i)\) to the previous point.
References
Banerjee, S., Bhore, S., Chitnis, R.: Algorithms and hardness results for nearest neighbor problems in bicolored point sets. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 80–93. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-77404-6_7
de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(3), 187–206 (2012)
Bhattacharya, B., Bishnu, A., Cheong, O., Das, S., Karmakar, A., Snoeyink, J.: Computation of non-dominated points using compact Voronoi diagrams. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 82–93. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11440-3_8
Biniaz, A., Cabello, S., Carmi, P., De Carufel, J.-L., Maheshwari, A., Mehrabi, S., Smid, M.: On the minimum consistent subset problem (2018). http://arxiv.org/abs/1810.09232
Gates, G.: The reduced nearest neighbor rule. IEEE Trans. Inform. Theory 18(3), 431–433 (1972)
Gottlieb, L., Kontorovich, A., Nisnevitch, P.: Near-optimal sample compression for nearest neighbors. IEEE Trans. Inform. Theory 64(6), 4120–4128 (2018). Also in NIPS 2014
Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Inform. Theory 14(3), 515–516 (1968)
Hwang, R.Z., Lee, R.C.T., Chang, R.C.: The slab dividing approach to solve the Euclidean \(p\)-center problem. Algorithmica 9(1), 1–22 (1993)
Khodamoradi, K., Krishnamurti, R., Roy, B.: Consistent subset problem with two labels. In: Panda, B.S., Goswami, P.P. (eds.) CALDAM 2018. LNCS, vol. 10743, pp. 131–142. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-74180-2_11
Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 865–877. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48350-3_72. Full version in arXiv:1504.05476
Masuyama, S., Ibaraki, T., Hasegawa, T.: Computational complexity of the \(m\)-center problems in the plane. Trans. Inst. Electron. Commun. Eng. Jpn. Section E E64(2), 57–64 (1981)
Ritter, G., Woodruff, H., Lowry, S., Isenhour, T.: An algorithm for a selective nearest neighbor decision rule. IEEE Trans. Inform. Theory 21(6), 665–669 (1975)
Wilfong, G.T.: Nearest neighbor problems. Int. J. Comput. Geom. Appl. 2(4), 383–416 (1992). Also in SoCG 1991
Acknowledgement
This work initiated at the Sixth Annual Workshop on Geometry and Graphs, March 11–16, 2018, at the Bellairs Research Institute of McGill University, Barbados. The authors are grateful to the organizers and to the participants of this workshop.
Ahmad Biniaz was supported by NSERC Postdoctoral Fellowship. Sergio Cabello was supported by the Slovenian Research Agency, program P1-0297 and projects J1-8130, J1-8155. Paz Carmi was supported by grant 2016116 from the United States – Israel Binational Science Foundation. Jean-Lou De Carufel, Anil Maheshwari, and Michiel Smid were supported by NSERC. Saeed Mehrabi was supported by NSERC and by Carleton-Fields Postdoctoral Fellowship.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Biniaz, A. et al. (2019). On the Minimum Consistent Subset Problem. In: Friggstad, Z., Sack, JR., Salavatipour, M. (eds) Algorithms and Data Structures. WADS 2019. Lecture Notes in Computer Science(), vol 11646. Springer, Cham. https://doi.org/10.1007/978-3-030-24766-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-24766-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24765-2
Online ISBN: 978-3-030-24766-9
eBook Packages: Computer ScienceComputer Science (R0)