atlas

Research map / Learning theory and algorithms / Clustering

Parameterized Approximation Algorithms for K-center Clustering and Variants

AAAI 2022 · Learning theory and algorithms › Clustering · approach: Coresets and dynamic clustering · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Voronoi separators to guess centers near the separator and recurse on separated subinstancesEuclidean k-center · Euclidean k-center, d dimensionsrunning time: 2^{O((k\log k)/{\epsilon})}dn -> O(|\mathcal C| \cdot k \cdot (1/\epsilon)^{O(d)} + 2^{O((1/\epsilon)^{O(d)} \cdot k^{1-Helped
Extend the center-selection scheme to handle different prescribed radii using MEBs and farthest uncovered pointsNon-uniform k-center · Euclidean non-uniform k-centerapproximation factor: (1+\epsilon)Helped
Use the closest available facility and open a ball with three times the guessed optimal radiusNon-uniform k-center · General metricsapproximation factor: 3Helped
Restrict the general-metric algorithm to client-centered facilities when \mathcal{C}=\mathcal{F}Non-uniform k-center · General metrics, \mathcal{C}=\mathcal{F}approximation factor: 3 -> 2Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy