Browse Tag

clustering to minimize the maximum intercluster distance

1 Article

K Centers Problem | Set 1 (Greedy Approximate Algorithm)

By Venkatesan Prabu

No Comment

K Centers Problem - Greedy Approximate Algorithm - Let OPT be the maximum distance of a city from a center in the Optimal...

@kaashiv

Popular Posts

29 Oct

Creating Safety That Feels Like Freedom

By Venkatesan Prabu

29 Oct

Avoidance Feels Like Relief Until It Does Not

By Venkatesan Prabu

29 Oct

An Honest Budget Is A Kinder One

By Venkatesan Prabu

Categories

Our site uses cookies. By using this site, you agree to the Privacy Policy and Terms of Use.

Accept