Online and incremental algorithms for facility location

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Fotakis, D en
dc.date.accessioned 2014-03-01T02:01:29Z
dc.date.available 2014-03-01T02:01:29Z
dc.date.issued 2011 en
dc.identifier.uri http://hdl.handle.net/123456789/29181
dc.subject Competitive Analysis en
dc.subject Competitive Ratio en
dc.subject Facility Location en
dc.subject Incremental Algorithm en
dc.title Online and incremental algorithms for facility location en
heal.type journalArticle en
heal.identifier.primary 10.1145/1959045.1959065 en
heal.identifier.secondary http://dx.doi.org/10.1145/1959045.1959065 en
heal.publicationDate 2011 en
heal.abstract In the online and incremental variants of Facility Location, the demands arrive one-by-one and must be assigned to an open facility upon arrival, without any knowledge about future demands. In the online variant, the decisions of opening a facility at a particular location and of assigning a demand to some facility are irrevocable. In the incremental variant, the algorithm can en
heal.journalName Sigact News en
dc.identifier.doi 10.1145/1959045.1959065 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