Online facility assignment

Abu Reyan Ahmed, Md Saidur Rahman, Stephen Kobourov

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We 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 ci to facility fj before the next customer ci+1 arrives. The cost of this assignment is the distance between ci and fj. The total number of customers is at most |F|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|F| and another one with competitive ratio |F|. Finally, we consider a variant in which the facilities are placed on the vertices of a graph and two algorithms in that setting.

Original languageEnglish (US)
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings
EditorsM. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
Number of pages13
ISBN (Print)9783319751719
StatePublished - 2018
Externally publishedYes
Event12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018 - Dhaka, Bangladesh
Duration: Mar 3 2018Mar 5 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10755 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Online facility assignment'. Together they form a unique fingerprint.

Cite this