NEAREST NEIGHBOR PROBLEMS

DOI10.1142/S0218195992000226zbMath0776.68102OpenAlexW2115342786MaRDI QIDQ3136223

Gordon Wilfong

Publication date: 26 November 1993

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195992000226

zbMATH Keywords

polynomial time algorithmNP-completeminimum size consistent subsetoptimal disc cover problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Related Items (4)

Supervised classification and mathematical optimization ⋮ Nearest neighbor representations of Boolean functions ⋮ Rough-fuzzy weighted \(k\)-nearest leader classifier for large data sets ⋮ On the minimum consistent subset problem

This page was built for publication: NEAREST NEIGHBOR PROBLEMS