K Centers Problem – Greedy Approximate Algorithm – Let OPT be the maximum distance of a city from a center in the Optimal solution. We need to show that
a best possible heuristic for the k-center problem
1 Article
1
K Centers Problem – Greedy Approximate Algorithm – Let OPT be the maximum distance of a city from a center in the Optimal solution. We need to show that