On the Competitive Ratio for Online Facility Location

Fotakis, D

dc.contributor.author	Fotakis, D	en
dc.date.accessioned	2014-03-01T02:49:20Z
dc.date.available	2014-03-01T02:49:20Z
dc.date.issued	2003	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34531
dc.subject	Competitive Ratio	en
dc.subject	Facility Location	en
dc.subject	Potential Function	en
dc.subject	Randomized Algorithm	en
dc.title	On the Competitive Ratio for Online Facility Location	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-45061-0_51	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-45061-0_51	en
heal.publicationDate	2003	en
heal.abstract	We consider the problem of Online Facility Location, where demands arrive online and must be irrevocably assigned 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 ( log n log log n). On the negative side, we show that no	en
heal.journalName	International Colloquium on Automata, Languages and Programming	en
dc.identifier.doi	10.1007/3-540-45061-0_51	en