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.
greedy algorithm tutorial
3 Articles
3
Greedy Algorithm to find Minimum number of Coins – Greedy Algorithm – Given a value V, if we want to make change for V Rs. and we have infinite supply of each of the denominations in Indian currency.
Activity Selection Problem – Greedy Algorithm – Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit.