Incremental Algorithms for Facility Location and k-Median

Fotakis, D

dc.contributor.author	Fotakis, D	en
dc.date.accessioned	2014-03-01T02:49:39Z
dc.date.available	2014-03-01T02:49:39Z
dc.date.issued	2004	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34664
dc.subject	Data Classification	en
dc.subject	Data Clustering	en
dc.subject	Facility Location	en
dc.subject	Hierarchical Structure	en
dc.subject	Incremental Algorithm	en
dc.subject	Information Retrieval	en
dc.subject	Online Algorithm	en
dc.subject	Performance Ratio	en
dc.title	Incremental Algorithms for Facility Location and k-Median	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-30140-0_32	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-30140-0_32	en
heal.publicationDate	2004	en
heal.abstract	In the incremental versions of Facility Location and k- Median, the demand points arrive one at a time and the algorithm must maintain a good solution by either adding each new demand to an ex- isting cluster or placing it in a new singleton cluster. The algorithm can also merge some of the existing clusters at any point in time.	en
heal.journalName	European Symposium on Algorithms	en
dc.identifier.doi	10.1007/978-3-540-30140-0_32	en