A primal-dual algorithm for online non-uniform facility location

Fotakis, D

dc.contributor.author	Fotakis, D	en
dc.date.accessioned	2014-03-01T01:55:44Z
dc.date.available	2014-03-01T01:55:44Z
dc.date.issued	2007	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/27831
dc.subject	Competitive Analysis	en
dc.subject	Competitive Ratio	en
dc.subject	Facility Location	en
dc.subject	Online Algorithm	en
dc.subject	primal-dual algorithm	en
dc.subject	Lower Bound	en
dc.title	A primal-dual algorithm for online non-uniform facility location	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.jda.2006.03.001	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.jda.2006.03.001	en
heal.publicationDate	2007	en
heal.abstract	In the online version of Facility Location, the demand points arrive one at a time and must be irrevocably assigned to an open facility upon arrival. The objective is to minimize the sum of facility and assignment costs. We present a simple deterministic primal-dual algorithm for the general case of non-uniform facility costs. We prove that its competitive ratio is	en
heal.journalName	Journal of Discrete Algorithms	en
dc.identifier.doi	10.1016/j.jda.2006.03.001	en