Asymmetric k-Center with Minimum Coverage

    Research output: Contribution to journalJournal articleResearchpeer-review


    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 languageEnglish
    JournalInformation Processing Letters
    Issue number4
    Pages (from-to)144-149
    Publication statusPublished - 2008


    Dive into the research topics of 'Asymmetric k-Center with Minimum Coverage'. Together they form a unique fingerprint.

    Cite this