Approximation algorithms for clustering with dynamic points

We study two generalizations of classic clustering problems called dynamic ordered k-median and dynamic k-supplier, where the points that need clustering evolve over time, and we are allowed to move the cluster centers between consecutive time steps. In these dynamic clustering problems, the general...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computer and system sciences Jg. 130; S. 43 - 70
Hauptverfasser:	Deng, Shichuan, Li, Jian, Rabani, Yuval
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.12.2022
Schlagworte:	Approximation algorithms Clustering Dynamic points Facility location Multi-objective optimization Facility location Approximation algorithms Multi-objective optimization Clustering Dynamic points
ISSN:	0022-0000, 1090-2724
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!