Show simple item record

dc.contributor.authorAhmed, Abu Reyan
dc.contributor.authorRahman, Md. Saidur
dc.contributor.authorKobourov, Stephen
dc.date.accessioned2018-07-23T22:42:19Z
dc.date.available2018-07-23T22:42:19Z
dc.date.issued2018
dc.identifier.citationAhmed A.R., Rahman M.S., Kobourov S. (2018) Online Facility Assignment. In: Rahman M., Sung WK., Uehara R. (eds) WALCOM: Algorithms and Computation. WALCOM 2018. Lecture Notes in Computer Science, vol 10755. Springer, Chamen_US
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-319-75172-6_14
dc.identifier.urihttp://hdl.handle.net/10150/628277
dc.description.abstractWe consider the online facility assignment problem, with a set of facilities F of equal capacity l in metric space and customers arriving one by one in an online manner. We must assign customer c(i) to facility f(j) before the next customer c(i+1) arrives. The cost of this assignment is the distance between ci and fj. The total number of customers is at most vertical bar F vertical bar l and each customer must be assigned to a facility. The objective is to minimize the sum of all assignment costs. We first consider the case where facilities are placed on a line so that the distance between adjacent facilities is the same and customers appear anywhere on the line. We describe a greedy algorithm with competitive ratio 4 vertical bar F vertical bar and another one with competitive ratio vertical bar F vertical bar. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.en_US
dc.description.sponsorshipNSF [CCF-AF 1712119]en_US
dc.language.isoenen_US
dc.publisherSPRINGER INTERNATIONAL PUBLISHING AGen_US
dc.relation.urlhttps://link.springer.com/chapter/10.1007%2F978-3-319-75172-6_14en_US
dc.rights© Springer International Publishing AG, part of Springer Nature 2018en_US
dc.titleOnline Facility Assignmenten_US
dc.typeArticleen_US
dc.identifier.eissn1611-3349
dc.contributor.departmentUniv Arizona, Dept Comp Scien_US
dc.identifier.journalWALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2018en_US
dc.description.note12 month embargo; published online: 31 January 2018en_US
dc.description.collectioninformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.en_US
dc.eprint.versionFinal accepted manuscripten_US


Files in this item

Thumbnail
Name:
walcom18.pdf
Size:
331.2Kb
Format:
PDF
Description:
Final Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record