Pith. sign in

URL:https://drops.dagstuhl

Schloss Dagstuhl – Leibniz-Zentrum f¨ ur Informatik · 2019 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · DOI 10.4230/lipics.icalp.2019.41

1 Pith paper cite this work, alongside 13 external citations. Polarity classification is still indexing.

1 Pith paper citing it
13 external citations · OpenAlex
open at publisher browse 1 citing papers

fields

cs.DS 1

years

2025 1

verdicts

ACCEPT 1

representative citing papers

Towards Tight Robust Coresets for $k$-Medians Clustering

cs.DS · 2025-07-15 · accept · novelty 8.0

New algorithms build robust k-medians coresets of size O(m)+O~(kd/epsilon^2) in VC or doubling metrics and O(m/epsilon)+O~(min{k^{4/3}/epsilon^2,k/epsilon^3}) in Euclidean space.

citing papers explorer

Showing 1 of 1 citing paper.

  • Towards Tight Robust Coresets for $k$-Medians Clustering cs.DS · 2025-07-15 · accept · none · ref 2019

    New algorithms build robust k-medians coresets of size O(m)+O~(kd/epsilon^2) in VC or doubling metrics and O(m/epsilon)+O~(min{k^{4/3}/epsilon^2,k/epsilon^3}) in Euclidean space.