How to place P post-offices in a city of N houses such that if every house wants to post a letter on a day then the overall distance traveled is minimum.
Consider city has 2d , each house is represented by a point, and we need to find P points such that sum of diff of P points and N points should be minimal.
No comments:
Post a Comment