K Centers Problem – Greedy Algorithm – Given n cities and distances between every pair of cities, select k cities to place warehouses ( ATM or Cloud Server)such that the maximum distance of a city to a warehouse is minimized.
logn
2 Articles
2
Asymptotic Notations – Analysis of Algorithms The main idea of asymptotic analysis is to have a measure of efficiency of algorithms that doesn’t depend on