On the Competitive Ratio for Online Facility Location

Fotakis, D

dc.contributor.author	Fotakis, D	en
dc.date.accessioned	2014-03-01T01:56:56Z
dc.date.available	2014-03-01T01:56:56Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/28278
dc.subject	Competitive Analysis	en
dc.subject	Competitive Ratio	en
dc.subject	Facility Location	en
dc.subject	Metric Space	en
dc.subject	Online Algorithm	en
dc.subject	Randomized Algorithm	en
dc.title	On the Competitive Ratio for Online Facility Location	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s00453-007-9049-y	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s00453-007-9049-y	en
heal.publicationDate	2008	en
heal.abstract	We consider the problem of Online Facility Location, where the demand points arrive online and must be assigned irrevocably to an open facility upon arrival. The objective is to minimize the sum of facility and assignment costs. We prove that the competitive ratio for Online Facility Location is Θ . On the negative side, we show that no randomized algorithm	en
heal.journalName	Algorithmica	en
dc.identifier.doi	10.1007/s00453-007-9049-y	en