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

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 130; pp. 43 - 70
Main Authors:	Deng, Shichuan, Li, Jian, Rabani, Yuval
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.12.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!