Abstract
In this paper, we revisit the r-gathering problem. Given sets C and F of points on the plane and distance d(c, f) for each \(c \in C\) and \(f\in F\), an r-gathering of C to F is an assignment A of C to open facilities \(F' \subseteq F\) such that r or more members of C are assigned to each open facility. The cost of an r-gathering is \(\max _{c \in C}{d(c, A(c))}\). The r-gathering problem computes the r-gathering minimizing the cost. In this paper we study the r-gathering problem when C and F are on a line and present a \(O(|C| + |F|)\)-time algorithm to solve the problem. Our solution is optimal since any algorithm needs to read C and F at least once.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aggarwal, G., et al.: Achieving anonymity via clustering. ACM Trans. Algorithms 6(3), 49:1–49:19 (2010)
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
Armon, A.: On min-max r-gatherings. Theor. Comput. Sci. 412(7), 573–582 (2011)
Drezner, Z.: Facility Location: A Survey of Applications and Methods. Springer, New York (1995)
Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer, Heidelberg (2001)
Gabow, H.N., Tarjan, R.E.: Algorithms for two bottleneck optimization problems. J. Algorithms 9(3), 411–417 (1988)
Nakano, S.: A simple algorithm for r-gatherings on the line. In: Rahman, M.S., Sung, W.-K., Uehara, R. (eds.) WALCOM 2018. LNCS, vol. 10755, pp. 1–7. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-75172-6_1
Han, Y., Nakano, S.: On r-gatherings on the line. In: Proceedings of FCS 2016, pp. 99–104 (2016)
Acknowledgement
First and second authors are partially supported through a grant from Pubali Bank Ltd.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Sarker, A., Sung, Wk., Rahman, M.S. (2019). A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract). In: Das, G., Mandal, P., Mukhopadhyaya, K., Nakano, Si. (eds) WALCOM: Algorithms and Computation. WALCOM 2019. Lecture Notes in Computer Science(), vol 11355. Springer, Cham. https://doi.org/10.1007/978-3-030-10564-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-10564-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-10563-1
Online ISBN: 978-3-030-10564-8
eBook Packages: Computer ScienceComputer Science (R0)