Journal article
Asymmetric k-Center with Minimum Coverage
In
Information Processing Letters
—
2008, Volume 105, Issue 4, pp. 144-149
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.
| Language: | English |
|---|---|
| Year: | 2008 |
| Pages: | 144-149 |
| ISSN: | 18726119 and 00200190 |
| Types: | Journal article |
| DOI: | 10.1016/j.ipl.2007.08.006 |
| ORCIDs: | Gørtz, Inge Li |
