Fully dynamic k-center clustering with outliers

DOI10.1007/S00453-023-01159-3MaRDI QIDQ6185941zbMATH OpenFDO

Authors

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

• scientific article; zbMATH DE number 6820208 (Why is no real title available?)
• scientific article; zbMATH DE number 7651196 (Why is no real title available?)
• A Lottery Model for Center-Type Problems With Outliers
• Algorithms for facility location problems with outliers. (Extended abstract)
• Fully Dynamic k-Center Clustering in Low Dimensional Metrics
• Fully dynamic \(k\)-center clustering with outliers
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
• Regular languages are testable with a constant number of queries
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• k-Center Clustering with Outliers in the Sliding-Window Model.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185941)