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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 130; s. 43 - 70
Hlavní autori:	Deng, Shichuan, Li, Jian, Rabani, Yuval
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.12.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!