Cargando…
Fair colorful k-center clustering
An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius [Formula: see text] such that there exist balls of radius [Formula: see text] around k of the...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Berlin Heidelberg
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8907124/ https://www.ncbi.nlm.nih.gov/pubmed/35300155 http://dx.doi.org/10.1007/s10107-021-01674-7 |