k-Center Problems with Minimum Coverage

• Main Authors: LIM, Andrew, RODRIGUES, Brian, WANG, Fan, XU, Zhou
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2005
• Subjects: Approximation algorithm; k-center problem; Minimum coverage; Operations and Supply Chain Management
• Online Access: https://ink.library.smu.edu.sg/lkcsb_research/2817; https://ink.library.smu.edu.sg/context/lkcsb_research/article/3816/viewcontent/kcenterProblemsMinCoverage_2005_pv.pdf
• Institution: Singapore Management University

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.