Sunday, August 14, 2016

K Centers Problem: Cities and Distances

Given n cities and distances between every pair of cities, select k cities to place warehouses (or ATMs or Cloud Server) such that the maximum distance of a city to a warehouse (or ATM or Cloud Server) is minimized.
For example consider the following four cities, 0, 1, 2 and 3 and distances between them, how do place 2 ATMs among these 4 cities so that the maximum distance of a city to an ATM is minimized.
http://www.geeksforgeeks.org/k-centers-problem-set-1-greedy-approximate-algorithm

1 comment:

  1. BlueHost is ultimately one of the best web-hosting company for any hosting services you require.

    ReplyDelete