Publication Type

Journal Article

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

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1016/j.tcs.2004.08.010

Share

COinS