Fully dynamic \(k\)-center clustering with outliers

DOI10.1007/s00453-023-01159-3MaRDI QIDQ6185941

No author found.

Publication date: 9 January 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

clusteringapproximation algorithmfully dynamic

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Regular Languages are Testable with a Constant Number of Queries
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• A Lottery Model for Center-Type Problems With Outliers
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
• Fully Dynamic k-Center Clustering in Low Dimensional Metrics
• k-Center Clustering with Outliers in the Sliding-Window Model.
• Fully dynamic \(k\)-center clustering with outliers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fully dynamic \(k\)-center clustering with outliers