Incremental algorithms for Facility Location and k-Median

Fotakis, D

dc.contributor.author	Fotakis, D	en
dc.date.accessioned	2014-03-01T01:55:04Z
dc.date.available	2014-03-01T01:55:04Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/27579
dc.subject	Facility Location	en
dc.subject	Incremental Algorithm	en
dc.subject	Online Algorithm	en
dc.subject	Performance Ratio	en
dc.title	Incremental algorithms for Facility Location and k-Median	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.tcs.2006.05.015	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.tcs.2006.05.015	en
heal.publicationDate	2006	en
heal.abstract	Abstract. In the incremental versions of Facility Location and,kMedian, the demand points arrive one at a time and the algorithm must maintain a good solution by either adding each new,demand,to an existing cluster or placing it in a new singleton cluster. The algorithm can also merge some of the existing clusters at any point in time. We present the first	en
heal.journalName	Theoretical Computer Science	en
dc.identifier.doi	10.1016/j.tcs.2006.05.015	en