Memoryless facility location in one pass

Fotakis, D

dc.contributor.author	Fotakis, D	en
dc.date.accessioned	2014-03-01T01:36:06Z
dc.date.available	2014-03-01T01:36:06Z
dc.date.issued	2011	en
dc.identifier.issn	1549-6325	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/21273
dc.subject	Facility location	en
dc.subject	Incremental algorithms	en
dc.subject	One-pass algorithms	en
dc.subject.other	Competitive ratio	en
dc.subject.other	Constant factors	en
dc.subject.other	Facility locations	en
dc.subject.other	Incremental algorithm	en
dc.subject.other	Memoryless	en
dc.subject.other	One-pass	en
dc.subject.other	Algorithms	en
dc.subject.other	Location	en
dc.title	Memoryless facility location in one pass	en
heal.type	journalArticle	en
heal.identifier.primary	10.1145/2000807.2000817	en
heal.identifier.secondary	49	en
heal.identifier.secondary	http://dx.doi.org/10.1145/2000807.2000817	en
heal.language	English	en
heal.publicationDate	2011	en
heal.abstract	We present the first one-pass memoryless algorithm for metric Facility Location that maintains a set of facilities approximating the optimal facility configuration within a constant factor. The algorithm is randomized and very simple to state and implement. It processes the demand points one-by-one as they arrive, and keeps in memory only the facility locations currently open. We prove that its competitive ratio is less than 14 in the special case of uniform facility costs, and less than 49 in the general case of nonuniform facility costs. © 2011 ACM.	en
heal.publisher	ASSOC COMPUTING MACHINERY	en
heal.journalName	ACM Transactions on Algorithms	en
dc.identifier.doi	10.1145/2000807.2000817	en
dc.identifier.isi	ISI:000296200900010	en
dc.identifier.volume	7	en
dc.identifier.issue	4	en