Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Business
K-Center Problems With Minimum Coverage, Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
K-Center Problems With Minimum Coverage, Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
Research Collection Lee Kong Chian School Of Business
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.