Abstract
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 \(c_i\) to facility \(f_j\) before the next customer \(c_{i+1}\) arrives. The cost of this assignment is the distance between \(c_i\) and \(f_j\). 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.
Work on this project was funded in part by NSF grant CCF-AF 1712119.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Akagi, T., Nakano, S.: On r-gatherings on the line. In: Wang, J., Yap, C. (eds.) FAW 2015. LNCS, vol. 9130, pp. 25–32. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19647-3_3
Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: A \(o(n)\)-competitive deterministic algorithm for online matching on a line. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 11–22. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18263-6_2
Armon, A.: On min-max r-gatherings. Theor. Comput. Sci. 412(7), 573–582 (2011)
Bansal, N., Buchbinder, N., Gupta, A., Naor, J.S.: An \({O}(\log ^2 k)\)-competitive algorithm for metric bipartite matching. Algorithmica 68(2), 390–403 (2012)
Bartal, Y., Koutsoupias, E.: On the competitive ratio of the work function algorithm for the k-server problem. Theor. Comput. Sci. 324(2–3), 337–345 (2004)
Bein, W.W., Chrobak, M., Larmore, L.L.: The 3-server problem in the plane. Theor. Comput. Sci. 289(1), 335–354 (2002)
Chrobak, M., Karloff, H., Payne, T., Vishwanathan, S.: New results on server problems. SIAM J. Discrete Math. 4(2), 291–300 (1990)
Chrobak, M., Larmore, L.L.: An optimal on-line algorithm for k-servers on trees. SIAM J. Comput. 20(1), 144–148 (1991)
Salhi, S., Drezner, E.: Facility location: a survey of applications and methods. J. Oper. Research Soc. 47(11), 1421 (1995). https://doi.org/10.2307/3010210
Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer, Heidelberg (2004)
Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478–488 (1993)
Kao, M.Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63–79 (1996)
Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theor. Comput. Sci. 127(2), 255–267 (1994)
Kleinberg, J.M.: A lower bound for two-server balancing algorithms. Inf. Process. Lett. 52(1), 39–43 (1994)
Koutsoupias, E., Papadimitriou, C.: The 2-evader problem. Inf. Process. Lett. 57(5), 249–252 (1996). https://doi.org/10.1016/0020-0190(96)00010-5
Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. J. Algorithms 11(2), 208–230 (1990)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Ahmed, 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, Cham. https://doi.org/10.1007/978-3-319-75172-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-75172-6_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-75171-9
Online ISBN: 978-3-319-75172-6
eBook Packages: Computer ScienceComputer Science (R0)