Algorithms and hardness results for nearest neighbor problems in bicolored point sets
From MaRDI portal
Publication:2294681
DOI10.1007/978-3-319-77404-6_7zbMath1485.68211OpenAlexW2793002333MaRDI QIDQ2294681
Sandip Banerjee, Sujoy Bhore, Rajesh Chitnis
Publication date: 12 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-77404-6_7
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms (68W40) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Minimum consistent subset of simple graph classes ⋮ Minimum consistent subset problem for trees ⋮ Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space ⋮ Nearest neighbor representations of Boolean functions ⋮ Minimum consistent subset of simple graph classes ⋮ On the minimum consistent subset problem
This page was built for publication: Algorithms and hardness results for nearest neighbor problems in bicolored point sets
