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 and an r-gathering of C to F is an assignment A of C to open facilities such that r or more members of C are assigned to each open facility. The cost of an r-gathering is. 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 -time algorithm to solve the problem. Our solution is optimal since any algorithm needs to read C and F at least once.
Cite
CITATION STYLE
Sarker, A., Sung, W. kin, & Rahman, M. S. (2019). A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11355 LNCS, pp. 56–66). Springer Verlag. https://doi.org/10.1007/978-3-030-10564-8_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
