Thumbnail
Access Restriction
Open

Author Sun, Yu ♦ Huang, Jin ♦ Chen, Yueguo ♦ Zhang, Rui ♦ Du, Xiaoyong
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Description Given a set of client locations, a set of facility locations where each facility has a service capacity, and the assump-tions that: (i) a client seeks service from its nearest facil-ity; (ii) a facility provides service to clients in the order of their proximity, we study the problem of selecting all pos-sible locations such that setting up a new facility with a given capacity at these locations will maximize the num-ber of served clients. This problem has wide applications in practice, such as setting up new distribution centers for on-line sales business and building additional base stations for mobile subscribers. We formulate the problem as location selection query for utility maximization. After applying three pruning rules to a baseline solution,we obtain an effi-cient algorithm to answer the query. Extensive experiments confirm the efficiency of our proposed algorithm.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Institution In: Proc. of CIKM (2012