HEAL DSpace

Memoryless Facility Location in One Pass

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Fotakis, D en
dc.date.accessioned 2014-03-01T02:50:16Z
dc.date.available 2014-03-01T02:50:16Z
dc.date.issued 2006 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/35004
dc.subject Competitive Ratio en
dc.subject Facility Location en
dc.subject Linear Time en
dc.title Memoryless Facility Location in One Pass en
heal.type conferenceItem en
heal.identifier.primary 10.1007/11672142_50 en
heal.identifier.secondary http://dx.doi.org/10.1007/11672142_50 en
heal.publicationDate 2006 en
heal.abstract We present the first one-pass memoryless algorithm for metric Facility Location which maintains a set of facilities approximating the optimal facility configuration within a constant factor. The algorithm considers the demand points one-by-one in arbitrary order, is randomized and very simple to state and implement. It runs in linear time and keeps in memory only the facility locations currently open. en
heal.journalName Symposium on Theoretical Aspects of Computer Science en
dc.identifier.doi 10.1007/11672142_50 en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record