On the minimum consistent subset problem

DOI10.1007/978-3-030-24766-9_12zbMath1498.68356arXiv1810.09232OpenAlexW2965295094MaRDI QIDQ5919308

Michiel H. M. Smid, Jean-Lou De Carufel, Ahmad Biniaz, Anil Maheshwari, Paz Carmi, Sergio Cabello, Saeed Mehrabi

Publication date: 16 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.09232

zbMATH Keywords

Voronoi diagramcircle coveringcolored pointsrange treeconsistent subsetparaboloid liftingplanar separator

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (5)

Minimum consistent subset of simple graph classes ⋮ Minimum consistent subset problem for trees ⋮ Nearest neighbor representations of Boolean functions ⋮ Guarantees on nearest-neighbor condensation heuristics ⋮ The inverse Voronoi problem in graphs. I: Hardness

This page was built for publication: On the minimum consistent subset problem