k-Center Problems with Minimum Coverage
Conference Proceeding Article
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 .
Operations and Supply Chain Management
Computing and Combinatorics: 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004: Proceedings
City or Country
LIM, Andrew; RODRIGUES, Brian; WANG, Fan; and XU, Zhou.
k-Center Problems with Minimum Coverage. (2004). Computing and Combinatorics: 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004: Proceedings. 3106, 349-354. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2400