k-Center Problems with Minimum Coverage

Publication Type

Conference Proceeding Article

Publication Date

8-2004

Abstract

The k-center problem is a well-known facility location problem and can be described as follows: Given a complete undirected graph G=(V,E), a metric d:V×V→ℝ +  and a positive integer k, we seek a subset U ⊆ V of at most k centers which minimizes the maximum distances from points in V to U. Formally, the objective function is given by: min U⊆V,|U|≤k max v∈V min r∈Ud(v,r).

As a typical example, we may want to set up k service centers (e.g., police stations, fire stations, hospitals, polling centers) and minimize the maximum distances between each client and these centers. The problem is known to be NP-hard [2].

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

Computing and Combinatorics: 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004: Proceedings

Volume

3106

First Page

349

Last Page

354

ISBN

9783540228561

Identifier

10.1007/978-3-540-27798-9_38

Publisher

Springer Verlag

City or Country

Heidelberg

Additional URL

https://doi.org/10.1007/978-3-540-27798-9_38

Link to Full Text

Share

COinS