Abstract
In this paper we give approximation algorithms and inapproximability results for various asymmetric k-center with minimum coverage problems. In the k-center with minimum coverage problem, each center is required to serve a minimum number of clients. These problems have been studied by Lim et al. [A. Lim, B. Rodrigues, F. Wang, Z. Xu, k-center problems with minimum coverage, Theoret. Comput. Sci. 332 (1–3) (2005) 1–17] in the symmetric setting.
Original language | English |
---|---|
Journal | Information Processing Letters |
Volume | 105 |
Issue number | 4 |
Pages (from-to) | 144-149 |
ISSN | 0020-0190 |
DOIs | |
Publication status | Published - 2008 |