A Primal-Dual Algorithm for Online Non-uniform Facility Location

Fotakis, D

dc.contributor.author	Fotakis, D	en
dc.date.accessioned	2014-03-01T02:49:56Z
dc.date.available	2014-03-01T02:49:56Z
dc.date.issued	2005	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34803
dc.subject	Competitive Ratio	en
dc.subject	Facility Location	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	conferenceItem	en
heal.identifier.primary	10.1007/11573036_5	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11573036_5	en
heal.publicationDate	2005	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 primal-dual deterministic algorithm for the general case of non-uniform facility costs. We prove that its competitive ratio is	en
heal.journalName	Panhellenic Conference on Informatics	en
dc.identifier.doi	10.1007/11573036_5	en