In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirements to balance the workload of centers while allowing each center to cater to a spread of clients. We study three variants of this problem, all of which are shown to be -hard. In-approximation hardness and approximation algorithms with factors equal or close to the best lower bounds are provided. Generalizations, including vertex costs and vertex weights, are also studied.
Approximation algorithm, k-center problem, Minimum coverage
Operations and Supply Chain Management
Theoretical Computer Science
LIM, Andrew; RODRIGUES, Brian; WANG, Fan; and XU, Zhou.
k-Center Problems with Minimum Coverage. (2005). Theoretical Computer Science. 332, (1), 1-17. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2817
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.