Publication Type
Journal Article
Version
publishedVersion
Publication Date
2-2005
Abstract
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.
Keywords
Approximation algorithm, k-center problem, Minimum coverage
Discipline
Operations and Supply Chain Management
Research Areas
Operations Management
Publication
Theoretical Computer Science
Volume
332
Issue
1
First Page
1
Last Page
17
ISSN
0304-3975
Identifier
10.1016/j.tcs.2004.08.010
Publisher
Elsevier
Citation
LIM, Andrew; RODRIGUES, Brian; WANG, Fan; and XU, Zhou.
k-Center Problems with Minimum Coverage. (2005). Theoretical Computer Science. 332, (1), 1-17.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/2817
Copyright Owner and License
Publisher
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1016/j.tcs.2004.08.010