Asymmetric k-Center with Minimum Coverage

Inge Li Gørtz

doi:10.1016/j.ipl.2007.08.006

Asymmetric k-Center with Minimum Coverage

Inge Li Gørtz

Research output: Contribution to journal › Journal article › Research › peer-review

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	https://doi.org/10.1016/j.ipl.2007.08.006
Publication status	Published - 2008

Access to Document

10.1016/j.ipl.2007.08.006

OpenUrl availability

Full text

Cite this

@article{5e661e4e067640beaa994de63c2fd377,

title = "Asymmetric k-Center with Minimum Coverage",

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.",

author = "G{\o}rtz, \{Inge Li\}",

year = "2008",

doi = "10.1016/j.ipl.2007.08.006",

language = "English",

volume = "105",

pages = "144--149",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Asymmetric k-Center with Minimum Coverage

AU - Gørtz, Inge Li

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

U2 - 10.1016/j.ipl.2007.08.006

DO - 10.1016/j.ipl.2007.08.006

M3 - Journal article

SN - 0020-0190

VL - 105

SP - 144

EP - 149

JO - Information Processing Letters

JF - Information Processing Letters

IS - 4

ER -

Asymmetric k-Center with Minimum Coverage

Abstract

Access to Document

OpenUrl availability

Fingerprint

Cite this